Approximate diagonalization in differential systems and an effective algorithm for the computation of the spectral matrix

1998/01/12 by B. M. Brown, M. S. P. Eastham, Brown, B. M. +5
Computer Science · Mathematics · #34L05 #34L40 #FOS: Mathematics #Matrix Theory and Algorithms #Numerical Analysis (math.NA) #Numerical methods for differential equations #Spectral Theory (math.SP) #Spectral Theory in Mathematical Physics

paper · pdf · doi:10.48550/arxiv.math/9801053

openalex publication_date 1998/01/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper reports on recent work to compute the asymptotic solution of a n-th order ordinary differential equation. Symbolic methods are used to compute the asymptotics over a large region. Application is made to the computation of the Titchmarsh-Weyl M-matrix for the fourth order operator.

Citations

• �ber gew�hnliche Differentialgleichungen mit Singularit�ten und die zugeh�rigen Entwicklungen willk�rlicher Funktionen

Related

• Extensions of a New Algorithm for the Numerical Solution of Linear Differential Systems on an Infinite Interval
• Diagonalisation method in the asymptotical theory for solutions of systems of ODE
• A new algorithm for computing the asymptotic solutions of a class of linear differential systems
• Asymptotics of solutions of differential equations with a spectral parameter
• Fine spectral estimates with applications to the optimally fast solution of large FDE linear systems