由三个特征对构造正定Jacobi矩阵

本文研究了由三个特征对构造正定Jacobi矩阵的问题,给出了这个问题有唯一解的充要条件及解的表达式,并给出了问题的数值算法.     

三对角对称矩阵特征值反问题

讨论了由四个特征对构造相应的三对角对称矩阵或Jacobi矩阵问题,得到了问题有唯一解的充要条件及解的表达式,并给出数值例子。     

三对角对称矩阵逆特征值问题存在唯一解的条件

讨论了利用给定的k(2≤k≤n)个特征对来构造相应的三对角对称矩阵的问题．在求解方法中,将已知的一些关系式等价转化成线性方程组,利用线性方程组的解存在唯一的条件,得到了所研究问题存在唯一解的充要条件,并给出了计算解的数值方法和数值实例．     

一类Jacobi矩阵的逆特征问题

1 引 言n阶实对称矩阵J=若bi>0(i=1,2,…,n-1),称J为Jacobi矩阵,全体记为Jn. Jacobi矩阵的逆特征问题有广泛的应用.文[1]给出了由三个特征对构造相应的Jaco-bi矩阵的逆特征问题有唯一解的条件,但没有考虑到特征对的顺序,也没有给出有解的条件.本文从振动工程的实际出发,提出如下两个问题:     

广义Jacobi矩阵的逆特征问题

本文主要讨论广义Jacobi阵及多个特征对的广义Jacobi阵逆特征问题.通过相似变换将广义Jacobi阵变换为三对角对称矩阵,其特征不变、特征向量只作线性变换,再应用前人理论求得广义Jacobi阵元素ai,|bi|,|ci|有唯一解的充要条件及其具体表达式.     

Jacobi矩阵特征值反问题的一个数值解法

本文利用Hessenberg矩阵特征值配置的一个结果以及三对角矩阵的有关性质,提出了一个求解Jacobi矩阵特征值反问题的数值方法。     

由谱数据和主子阵的顺序特征对构造Jacobi矩阵

讨论由谱数据和主子阵的顺序特征对构造Jacobi矩阵问题,给出该问题有解的充分必要条件和求解的数值方法。     

一类特殊矩阵的逆特征值问题

本文研究了一类具有特殊形式的矩阵A的两个逆特征值问题.利用箭形矩阵和Jacobi矩阵的性质,将此类矩阵逆特征值问题转换为线性方程组问题,得到了问题有唯一解的充分必要条件,给出了解的表达式及相应数值例子,推广了箭形矩阵和Jacobi矩阵逆特征值问题.     

GPSD迭代法和Jacobi迭代法的敛散关系

证明了当Jacobi迭代矩阵B非负时,解线性方程组Ax=b(A为不可约矩阵)的GPSD迭代法(0＜ωi＜Ti≤1,i=1,2,…,n)和Jacobi迭代法同时敛散,给出了其谱半径p(ST,Ω)和ρ(B)之间的关系.     

三对角矩阵计算

1 引言 在数值计算中,有许多问题最后归结为三对角矩阵的计算,因此研究它们的计算方法是有意义的。此外,有些三对角阵的计算方法可以做为带状阵计算的借鉴。 本文讨论三对角线性方程组的解耦算法,矩阵的LR~(-1)分解,求行列式,Jacobi矩阵的特征值与特征向量的关系以及三对角阵求逆等方面的问题,与现有的算法比较,本文的算法具有计算量或存贮量较少,或计算精度较高,或编程较简单等某些特点。 设A为n阶非奇实三对角阵:     

A new Jacobi operational matrix: An application for solving fractional differential equations

In this paper, we derived the shifted Jacobi operational matrix (JOM) of fractional derivatives which is applied together with spectral tau method for numerical solution of general linear multi-term fractional differential equations (FDEs). A new approach implementing shifted Jacobi operational matrix in combination with the shifted Jacobi collocation technique is introduced for the numerical solution of nonlinear multi-term FDEs. The main characteristic behind this approach is that it reduces such problems to those of solving a system of algebraic equations which greatly simplifying the problem. The proposed methods are applied for solving linear and nonlinear multi-term FDEs subject to initial or boundary conditions, and the exact solutions are obtained for some tested problems. Special attention is given to the comparison of the numerical results obtained by the new algorithm with those found by other known methods.     

A new Jacobi rational–Gauss collocation method for numerical solution of generalized pantograph equations

This paper is concerned with a generalization of a functional differential equation known as the pantograph equation which contains a linear functional argument. In this article, a new spectral collocation method is applied to solve the generalized pantograph equation with variable coefficients on a semi-infinite domain. This method is based on Jacobi rational functions and Gauss quadrature integration. The Jacobi rational-Gauss method reduces solving the generalized pantograph equation to a system of algebraic equations. Reasonable numerical results are obtained by selecting few Jacobi rational–Gauss collocation points. The proposed Jacobi rational–Gauss method is favorably compared with other methods. Numerical results demonstrate its accuracy, efficiency, and versatility on the half-line.     

Application of homotopy perturbation methods for solving systems of linear equations

In this paper, homotopy perturbation methods (HPMs) are applied to obtain the solution of linear systems, and conditions are deduced to check the convergence of the homotopy series. Moreover, we have adapted the Richardson method, the Jacobi method, and the Gauss-Seidel method to choose the splitting matrix. The numerical results indicate that the homotopy series converges much more rapidly than the direct methods for large sparse linear systems with a small spectrum radius.     

关于Jacobi矩阵的特征值反问题可解的充分必要条件的一个注记 (英)

本文讨论一类具有特殊结构的Jacobi矩阵的特征值反问题,该问题由描述变截面杆的微分方程离散化得到．我们得到了这个问题有解的一些必要条件,并且通过一些数值例子,说明了L．Lu和K．Michael给出的充分条件和算法在矩阵的阶数高于3的时候是错误的。     

Polynomial spectral collocation method for space fractional advection–diffusion equation

This article discusses the spectral collocation method for numerically solving nonlocal problems: one‐dimensional space fractional advection–diffusion equation; and two‐dimensional linear/nonlinear space fractional advection–diffusion equation. The differentiation matrixes of the left and right Riemann–Liouville and Caputo fractional derivatives are derived for any collocation points within any given bounded interval. Several numerical examples with different boundary conditions are computed to verify the efficiency of the numerical schemes and confirm the exponential convergence; the physical simulations for Lévy–Feller advection–diffusion equation and space fractional Fokker–Planck equation with initial δ‐peak and reflecting boundary conditions are performed; and the eigenvalue distributions of the iterative matrix for a variety of systems are displayed to illustrate the stabilities of the numerical schemes in more general cases. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 514–535, 2014     

Tanh Jacobi spectral collocation method for the numerical simulation of nonlinear Schrödinger equations on unbounded domain

We present a class of orthogonal functions on infinite domain based on Jacobi polynomials. These functions are generated by applying a tanh transformation to Jacobi polynomials. We construct interpolation and projection error estimates using weighted pseudo-derivatives tailored to the involved mapping. Then, using the nodes of the newly introduced tanh Jacobi functions, we develop an efficient spectral tanh Jacobi collocation method for the numerical simulation of nonlinear Schrödinger equations on the infinite domain without using artificial boundary conditions. The applicability and accuracy of the solution method are demonstrated by two numerical examples for solving the nonlinear Schrödinger equation and the nonlinear Ginzburg–Landau equation.     

A highly accurate Jacobi collocation algorithm for systems of high‐order linear differential–difference equations with mixed initial conditions

In this paper, a shifted Jacobi–Gauss collocation spectral algorithm is developed for solving numerically systems of high‐order linear retarded and advanced differential–difference equations with variable coefficients subject to mixed initial conditions. The spatial collocation approximation is based upon the use of shifted Jacobi–Gauss interpolation nodes as collocation nodes. The system of differential–difference equations is reduced to a system of algebraic equations in the unknown expansion coefficients of the sought‐for spectral approximations. The convergence is discussed graphically. The proposed method has an exponential convergence rate. The validity and effectiveness of the method are demonstrated by solving several numerical examples. Numerical examples are presented in the form of tables and graphs to make comparisons with the results obtained by other methods and with the exact solutions more easier. Copyright © 2015 John Wiley & Sons, Ltd.     

Generalized Jacobi and Gauss-Seidel Methods for Solving Linear System of Equations

The Jacobi and Gauss-Seidel algorithms are among the stationary iterative methods for solving linear system of equations. They are now mostly used as precondition-ers for the popular iterative solvers. In this paper a generalization of these methods are proposed and their convergence properties are studied. Some numerical experiments are given to show the efficiency of the new methods.     

JACOBI PSEUDOSPECTRAL METHOD FOR FOURTH ORDER PROBLEMS

In this paper, we investigate Jacobi pseudospectral method for fourth order problems. We establish some basic results on the Jacobi-Gauss-type interpolations in non-uniformly weighted Sobolev spaces, which serve as important tools in analysis of numerical quadratures, and numerical methods of differential and integral equations. Then we propose Jacobi pseudospectral schemes for several singular problems and multiple-dimensional problems of fourth order. Numerical results demonstrate the spectral accuracy of these schemes, and coincide well with theoretical analysis.