Practical Implementation and Error Bound of Integer-Type Algorithm for Higher-Order Differential Equations
DOI10.1080/01630563.2011.595602zbMath1416.65239arXiv0903.4850OpenAlexW3105377629MaRDI QIDQ3114596
Fuminori Sakaguchi, Masahito Hayashi
Publication date: 19 February 2012
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0903.4850
error boundinteger-type algorithmrational-type smooth basis functionsuper-high accuracyhigher-order linear ODEquasi-orthogonalizationsemi-analytical numerical analysis
Theoretical approximation of solutions to ordinary differential equations (34A45) Linear ordinary differential equations and systems (34A30) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Error bounds for numerical methods for ordinary differential equations (65L70)
Related Items (2)
Cites Work
- 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
- General Theory for Integer-Type Algorithm for Higher Order Differential Equations
- Coherent states and annihilation–creation operators associated with the irreducible unitary representations of 𝔰𝔲(1,1)
This page was built for publication: Practical Implementation and Error Bound of Integer-Type Algorithm for Higher-Order Differential Equations