Finite Element Orthogonal Collocation Approach for Time Fractional Telegraph Equation with Mamadu-Njoseh Polynomials

Finite element method (FEM) is an efficient numerical tool for the solution of partial differential equations (PDEs). It is one of the most general methods when compared to other numerical techniques. PDEs posed in a variational form over a given space, say a Hilbert space, are better numerically handled with the FEM. The FEM algorithm is used in various applications which includes fluid flow, heat transfer, acoustics, structural mechanics and dynamics, electric and magnetic field, etc. Thus, in this paper, the Finite Element Orthogonal Collocation Approach (FEOCA) is established for the approximate solution of Time Fractional Telegraph Equation (TFTE) with Mamadu-Njoseh polynomials as grid points corresponding to new basis functions constructed in the finite element space. The FEOCA is an elegant mixture of the Finite Element Method (FEM) and the Orthogonal Collocation Method (OCM). Two numerical examples are experimented on to verify the accuracy and rate of convergence of the method as compared with the theoretical results, and other methods in literature.

宽负荷下切圆燃煤锅炉H_(2)S分布特性的数值模拟

锅炉采用空气分级燃烧降低NO_(x)排放的同时也提高了主燃区H_(2)S体积分数。炉墙壁面过高的H_(2)S体积分数是加剧水冷壁高温腐蚀的重要因素。为保障新能源并网发电,大型燃煤机组灵活调峰的需求增加,不同负荷下的水冷壁近壁面H_(2)S分布特性值得关注。通过正交试验分析了切圆燃煤锅炉运行参数对水冷壁近壁面H_(2)S体积分数分布的影响。选取一台超临界600 MW切圆燃煤锅炉建立数值模型,设计L_(16)(4^(5))正交工况,覆盖100%BMCR、75%THA,50%THA以及35%BMCR四种负荷。建立了自定义SO_(x)生成模型以确定燃料硫的析出和转化路径,模型包含多表面反应子模型以描述焦炭与O_(2)/CO_(2)/H_(2)O等3种气体的异相反应,并确定焦炭气化反应消耗量占总消耗量的比例,进而对炉膛H_(2)S空间分布进行了模拟计算。研究表明,近壁面高体积分数H_(2)S区域主要位于投运燃烧器层中最下层燃烧器以下以及最上层燃烧器以上至SOFA层之间,烟气切圆沿炉膛高度增加逐渐增大是造成后一区域H_(2)S体积分数较高的重要原因。35%BMCR负荷下水冷壁重点区域的H_(2)S平均体积分数为364μL/L,明显低于其他负荷。锅炉运行参数对重点区域H_(2)S体积分数影响程度的排序为:锅炉负荷>一次风率>主燃区空气过量系数>假想切圆直径>燃烧器竖直摆角。

ASYMPTOTICS OF ORTHOGONAL POLYNOMIALS VIA THE RIEMANN-HILBERT APPROACH

In this survey we give a brief introduction to orthogonal polynomials, including a short review of classical asymptotic methods. Then we turn to a discussion of the Riemann-Hilbert formulation of orthogonal polynomials, and the Delft ＆ Zhou method of steepest descent. We illustrate this new approach, and a modified version, with the Hermite polynomials. Other recent progress of this method is also mentioned, including applications to discrete orthogonal polynomials, orthogonal polynomials on curves, multiple orthogonal polynomials, and certain orthogonal polynomials with singular behavior.

ORTHOGONAL POLYNOMIALS AND DETERMINANT FORMULAS OF FUNCTION-VALUED PADE-TYPE APPROXIMATION USING FOR SOLUTION OF INTEGRAL EQUATIONS

To solve Fredholm integral equations of the second kind, a generalized linear functional is introduced and a new function-valued Padé-type approximation is defined. By means of the power series expansion of the solution, this method can construct an approximate solution to solve the given integral equation. On the basis of the orthogonal polynomials, two useful determinant expressions of the numerator polynomial and the denominator polynomial for Padé-type approximation are explicitly given.

ORTHOGONAL MATRIX POLYNOMIALS WITH RESPECT TO LINEAR MATRIX MOMENT FUNCTION ALS:THEORY AND APPLICATIONS

In this paper orthogonal matrix polynomials with respect to a right matrix moment functional an introduced. Basic results, important examples and applications to the approximation of matrix integrals are studied. Error bounds for the proposed matrix quadrature rules are given.

A SEMI-CONJUGATE MATRIX BOUNDARY VALUE PROBLEM FOR GENERAL ORTHOGONAL POLYNOMIALS ON AN ARBITRARY SMOOTH JORDAN CURVE

In this article, the author characterizes orthogonal polynomials on an arbitrary smooth Jordan curve by a semi-conjugate matrix boundary value problem, which is different from the Riemann-Hilbert problems that appear in the theory of Riemann -Hilbert approach to asymptotic analysis for orthogonal polynomials on a real interval introduced by Fokas, Its, and Kitaev and on the unit circle introduced by Baik, Deift, and Johansson. The author hopes that their characterization may be applied to asymptotic analysis for general orthogonal polynomials by combining with a new extension of steepest descent method which we are looking for.

Numerical Solutions of Volterra Equations Using Galerkin Method with Certain Orthogonal Polynomials

This work is aim at providing a numerical technique for the Volterra integral equations using Galerkin method. For this purpose, an effective matrix formulation is proposed to solve linear Volterra integral equations of the first and second kind respectively using orthogonal polynomials as trial functions which are constructed in the interval [-1,1] with respect to the weight function w(x)=1+x2. The efficiency of the proposed method is tested on several numerical examples and compared with the analytic solutions available in the literature.

Galerkin Method for Numerical Solution of Volterra Integro-Differential Equations with Certain Orthogonal Basis Function

This paper concerns the implementation of the orthogonal polynomials using the Galerkin method for solving Volterra integro-differential and Fredholm integro-differential equations. The constructed orthogonal polynomials are used as basis functions in the assumed solution employed. Numerical examples for some selected problems are provided and the results obtained show that the Galerkin method with orthogonal polynomials as basis functions performed creditably well in terms of absolute errors obtained.

Estimating probability curves of rock variables using orthogonal polynomials and sample moments

A new algorithm using orthogonal polynomials and sample moments was presented for estimating probability curves directly from experimental or field data of rock variables. The moments estimated directly from a sample of observed values of a random variable could be conventional moments (moments about the origin or central moments) and probability-weighted moments (PWMs). Probability curves derived from orthogonal polynomials and conventional moments are probability density functions (PDF), and probability curves derived from orthogonal polynomials and PWMs are inverse cumulative density functions (CDF) of random variables. The proposed approach is verified by two most commonly-used theoretical standard distributions: normal and exponential distribution. Examples from observed data of uniaxial compressive strength of a rock and concrete strength data are presented for illustrative purposes. The results show that probability curves of rock variable can be accurately derived from orthogonal polynomials and sample moments. Orthogonal polynomials and PWMs enable more secure inferences to be made from relatively small samples about an underlying probability curve.

ORTHOGONAL MATRIX POLYNOMIALS WITH RESPECT TO A CONJUGATE BILINEAR MATRIX MOMENT FUNCTIONAL: BASIC THEORY

In this paper basic results for a theory of orthogonal matrix polynomials with respect to a conjugate bilinear matrix moment functional are proposed. Properties of orthogonal matrix polynomial sequences including a three term matrix relationship are given. Positive definite conjugate bilinear matrix moment functionals are introduced and a characterization of positive definiteness in terms of a block Haenkel moment matrix is established. For each positive definite conjugate bilinear matrix moment functional an associated matrix inner product is defined.

Bifurcation Analysis of a Nonlinear Vibro-Impact System with an Uncertain Parameter via OPA Method

In this paper,the bifurcation properties of the vibro-impact systems with an uncertain parameter under the impulse and harmonic excitations are investigated.Firstly,by means of the orthogonal polynomial approximation(OPA)method,the nonlinear damping and stiffness are expanded into the linear combination of the state variable.The condition for the appearance of the vibro-impact phenomenon is to be transformed based on the calculation of themean value.Afterwards,the stochastic vibro-impact systemcan be turned into an equivalent high-dimensional deterministic non-smooth system.Two different Poincarésections are chosen to analyze the bifurcation properties and the impact numbers are identified for the periodic response.Consequently,the numerical results verify the effectiveness of the approximation method for analyzing the considered nonlinear system.Furthermore,the bifurcation properties of the system with an uncertain parameter are explored through the high-dimensional deterministic system.It can be found that the excitation frequency can induce period-doubling bifurcation and grazing bifurcation.Increasing the randomintensitymay result in a diffusion-based trajectory and the impact with the constraint plane,which induces the topological behavior of the non-smooth system to change drastically.It is also found that grazing bifurcation appears in advance with increasing of the random intensity.The stronger impulse force can result in the appearance of the diffusion phenomenon.

ON A FAMILY OF MULTIVARIATE LEAST-SQUARES ORTHOGONAL POLYNOMIALS

In this paper the new notion of multivariate least-squares orthogonal poly-nomials from the rectangular form is introduced. Their existence and uniqueness isstudied and some methods for their recursive computation are given. As an applica-is constructed.

THE ORTHOGONAL POLYNOMIALS AND THE PADE'APPROXIMATION

The diagonal Pade' approximates for exp(x). tanx and tanhx are obtained in asimple manner by using the property of Legendre polynomials that on [ -1, 1] Pn (x)is orthogonal to every polynomial of lower degree. Gauss's quadrature formula is used tofined the denomiators of some functions.

Flutter Analysis of Aircraft Wing Using Equivalent-Plate Models with Orthogonal Polynomials

A method of equivalent simplification,using equivalent-plate models(EPMs),is developed.It is to achieve goals of rapid modeling and effective analysis in structural dynamics and flutter analysis of complex wing structures.It is on the assumption that the wing structures discussed are composed of skin,beams and ribs,and the different plate units(such as skin,beam web,rib web)are not distinguished in modeling,which is to avoid the complex pre-processing and make it more generalized.Taking the effect of transverse shear deformation into consideration,the equivalence is based on the first-order shear deformation theory,and it can import the model files of MSC/NASTRAN and process the information to accomplish the equivalent modeling.The Ritz method is applied with the Legendre polynomials,which is used to define the geometry,structure and displacements of the wing.Particularly,the selection of Legendre polynomials as trial functions brings good accuracy to the modeling and can avoid the ill-conditions.This is in contrast to the EPM method based on the classical plate theory.Through vibration and flutter analysis,the results obtained by using EPM agree well with those obtained by the finite element method,which indicates the accuracy and effectiveness in vibration and flutter analysis of the EPM method.

Orthogonal Polynomials and Padé Approximation

The diagonal Padé approximants for exp ( x ), tan x and tanh x are obtained in a simple manner by using the property of Legendre polynomials that on P r1 (x) is orthogonal to every polynomial of lower degree. Gauss's quadrature formula is used to find the denominators of some functions.

A NOTE ON SOBOLEV ORTHOGONALITY FOR LAGUERRE MATRIX POLYNOMIALS

Abstract. Let {L（Ln^（A,λ）（x）}n≥0 be the sequence of monic Laguerre matrix polynomials defined on [0,∞） byLn^（A,λ）（x）=n!/（-λ）^n ∑nk-0（-λ）^k/k!（n-k）!（A＋I）n[（A＋I）k]^-1x^k,where A ∈ C^r×r. It is known that {Ln^（A,λ）（x）}n≥0 is orthogonal with respect to a matrix moment functional when A satisfies the spectral condition that Re（z） 〉 -1 for every z E or（a）. In this note we show that forA such that σ（A） does not contain negative integers, the Laguerre matrix polynomials Ln^（A,λ）（x） are orthogonal with respect to a non-diagonal SobolevLaguerre matrix moment functional, which extends two cases： the above matrix case and the known scalar case.

Optimizing Connections:Applied Shortest Path Algorithms for MANETs

This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks(MANETs)from dynamic topologies that pose great challenges because of the mobility of nodes.Themain objective was to delve into and refine the application of the Dijkstra’s algorithm in this context,a method conventionally esteemed for its efficiency in static networks.Thus,this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm,considering adaptation to the dynamic network conditions that are typical for MANETs.This paper has shown through detailed algorithmic analysis that Dijkstra’s algorithm,when adapted for dynamic updates,yields a very workable solution to the problem of real-time routing in MANETs.The results indicate that with these changes,Dijkstra’s algorithm performs much better computationally and 30%better in routing optimization than Bellman-Ford when working with configurations of sparse networks.The theoretical framework adapted,with the adaptation of the Dijkstra’s algorithm for dynamically changing network topologies,is novel in this work and quite different from any traditional application.The adaptation should offer more efficient routing and less computational overhead,most apt in the limited resource environment of MANETs.Thus,from these findings,one may derive a conclusion that the proposed version of Dijkstra’s algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional methods.This paper,therefore,operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness.

Towards an Algebraic Theory of Orthogonal Polynomials in Several Variables

In this paper, we review on a general theory of orthogonal polynomials in several variables (O.P.S.V) in which we present two different approaches for the three-term recurrence relation. We draw attention to the fact that it is possible to take advantage of the orthogonal projection approach of the three-term recurrence relation towards the development of the algebraic theory of O.P.S.V.

On a New Family of Weighted Least-square Orthogonal Polynomials in Multivariables

This paper introduces a new notion of weighted least-square orthogonal polynomials in multivariables from the triangular form. Their existence and uniqueness is studied and some methods for their recursive computation are given. As an application, this paper constructs a new family of Pade-type approximates in multi-variables from the triangular form.

Jacobi-Sobolev Orthogonal Polynomialsand Spectral Methods for Elliptic Boundary Value Problems

Generalized Jacobi polynomials with indexes α,β∈ R are introduced and some basic properties are established. As examples of applications,the second- and fourth-order elliptic boundary value problems with Dirichlet or Robin boundary conditions are considered,and the generalized Jacobi spectral schemes are proposed. For the diagonalization of discrete systems,the Jacobi-Sobolev orthogonal basis functions are constructed,which allow the exact solutions and the approximate solutions to be represented in the forms of infinite and truncated Jacobi series. Error estimates are obtained and numerical results are provided to illustrate the effectiveness and the spectral accuracy.