General Theory for Integer-Type Algorithm for Higher Order Differential Equations

DOI10.1080/01630563.2011.557917zbMath1229.65144arXiv0903.4848OpenAlexW3100447125MaRDI QIDQ3016310

Fuminori Sakaguchi, Masahito Hayashi

Publication date: 15 July 2011

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0903.4848

zbMATH Keywords

eigenfunctionnumerical analysisband-diagonal matrixhigher-order linear Odeinteger-type algorithmrational-type smooth basis functionsuper-high accuracy

Mathematics Subject Classification ID

Theoretical approximation of solutions to ordinary differential equations (34A45) General harmonic expansions, frames (42C15) Finite element, Rayleigh-Ritz, Galerkin and collocation methods for ordinary differential equations (65L60) Numerical methods for ordinary differential equations (65L99)

Related Items (3)

Positive-instantaneous frequency and approximation ⋮ A Theory on Non-Constant Frequency Decompositions and Applications ⋮ Practical Implementation and Error Bound of Integer-Type Algorithm for Higher-Order Differential Equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analytic unit quadrature signals with nonlinear phase
• On Lovász' lattice reduction and the nearest lattice point problem
• Factoring polynomials with rational coefficients
• Two families of unit analytic signals with nonlinear phase
• Ten Lectures on Wavelets
• Coherent states and annihilation–creation operators associated with the irreducible unitary representations of 𝔰𝔲(1,1)

This page was built for publication: General Theory for Integer-Type Algorithm for Higher Order Differential Equations