An algorithm for computing Jordan chains and inverting analytic matrix functions
analytic matrix functionanalytic perturbationJordan chainKeldysh chainLaurent seriesmatrix inversionmatrix-valued functionsolution of linear constant coefficient ODE
Theory of matrix inversion and generalized inverses (15A09) Canonical forms, reductions, classification (15A21) Matrix pencils (15A22) Explicit solutions, first integrals of ordinary differential equations (34A05) Series expansions (e.g., Taylor, Lidstone series, but not Fourier series) (41A58) Chains (nests) of projections or of invariant subspaces, integrals along chains, etc. (47A46) Functions whose values are linear operators (operator- and matrix-valued functions, etc., including analytic and meromorphic ones) (47A56)
The main motivation for this paper, according to the author, is solving linear systems of ODE's with linear differential operator with constant coefficients of the form \[ A_l{d^lx\over{dt^l}}+\cdots+ A_0x=0.\tag{1} \] A solution of the equation (1) can be expressed as a vector function \[ x(t)=\sum_{j=0}^k {{t^{k-j}}\over{(k-j)!}}x_j, \] provided that the following identity holds: \[ \sum_{m=0}^k{{t^{k-m}e^{\lambda_0t}} \over{(k-m)!}}\left[\sum_{j=0}^m{1\over{j!}}A^{(j)}(\lambda_0)x_{m-j}\right]=0, \] with \(A(\lambda)=A_0+\cdots+{\lambda}^lA_l\). The sequence of vectors \(\{x_j\}\) forms, generally speaking, the so-called Jordan chain of the matrix \(A(\lambda)\) at \(\lambda_0\). Hence the proposed algorithm is looking for convenient Jordan chains (see Algorithm 3.1). This procedure starts from the kernel of \(A_0\) and then deals with certain extensions of matrices created at consecutive steps, thus extensions of system of columns to full basis are needed. As a byproduct, algorithms for finding the Laurent series for \(A(\lambda)^{-1}\) are given (see the Algorithms 4.1, 4.6). The floating-point and the `symbolic' versions of the algorithms are discussed and compared. Reviewer's remark. I agree with the author that the proposed algorithm (rather complicated and fastidious, mostly in the case of large dimensions) can be useful when a discussion of the solution, or when the `symbolic' computing is needed. However, in the situations most frequently met in computational practice such as, for example, when evaluation of the solution of the initial value problem for (1) is desired, very simple finite difference algorithms are much more effective. Nonetheless, the problem presented in this paper seems to be interesting from the theoretical point of view.
- Computation of Jordan chains by generalized characteristic matrices
- Direct and inverse computation of Jacobi matrices of infinite iterated function systems
- A simple algorithm for computing analytic functions of real square matrices
- Algorithms for the inverse eigenvalue problem concerning Jacobi matrices and \(T\)-matrices
- Analytic Inverses and Determinants for a Class of Matrices
- A new algorithm for an inverse eigenvalue problem on Jacobi matrices
- Jordan-Schur algorithms for computing the matrix exponential
- scientific article; zbMATH DE number 822165
- Analytic inversion for a general case of certain classes of matrices
- A Geometric Approach to Perturbation Theory of Matrices and Matrix Pencils. Part I: Versal Deformations
- Analytic perturbation theory for matrices and operators. Licensed ed
- Construction of Corner Singularities for Agmon-Douglis-Nirenberg Elliptic Systems
- scientific article; zbMATH DE number 4111361 (Why is no real title available?)
- scientific article; zbMATH DE number 3756646 (Why is no real title available?)
- scientific article; zbMATH DE number 3756883 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 3070738 (Why is no real title available?)
- Inversion of analytic matrix functions that are singular at the origin
- Inversion of lamdba-matrices and application to the theory of linear vibrations
- Locating the zeros of an analytic function
- On Series Expansions and Stochastic Matrices
- On the local theory of regular analytic matrix functions
- The Laurent expansion for a nearly singular matrix
- The Laurent expansion of pencils that are singular at the origin
- The Rotation of Eigenvectors by a Perturbation. III
- The fundamental equations for inversion of operator pencils on Banach space
- Some results on eigenvalues of finite type, resolvents and Riesz projections
- Inversion of operator pencils on Banach space using Jordan chains when the generalized resolvent has an isolated essential singularity
- The fundamental equations for the generalized resolvent of an elementary pencil in a unital Banach algebra
- Spatially quasi-periodic bifurcations from periodic traveling water waves and a method for detecting bifurcations using signed singular values
- Inverting a matrix function around a singularity via local rank factorization
- Accurate spectral numerical schemes for kinetic equations with energy diffusion
- Approximate diagonalization in differential systems and an effective algorithm for the computation of the spectral matrix
- Closed form solution for the equations of motion for constrained linear mechanical systems and generalizations: an algebraic approach
- INVERSION OF OPERATOR PENCILS ON HILBERT SPACE
- Harmonic stability of standing water waves
- An explicit formula for the splitting of multiple eigenvalues for nonlinear eigenvalue problems and connections with the linearization for the delay eigenvalue problem
- A local construction of the Smith normal form of a matrix polynomial
- Inversion of regular analytic matrix functions: Local Smith form and subspace duality
- Continuation of eigenvalues and invariant pairs for parameterized nonlinear eigenvalue problems
- Computation of time-periodic solutions of the Benjamin-Ono equation
This page was built for publication: An algorithm for computing Jordan chains and inverting analytic matrix functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2383013)
