Complexity theory for Lie-group solvers

DOI10.1006/jcom.2001.0615zbMath0996.65070OpenAlexW2004214566WikidataQ115395637 ScholiaQ115395637MaRDI QIDQ1599203

Syvert P. Nørsett, Arieh Iserles, Bojan Orel, Elena Celledoni

Publication date: 5 June 2002

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.2001.0615

zbMATH Keywords

complexityalgorithmsmatrix exponentialMagnus methodLie-group methodFer and Magnus expansionsFer methodRunge-Kutta-Munthe-Kaas schemes

Mathematics Subject Classification ID

Geometric methods in ordinary differential equations (34A26) Nonlinear ordinary differential equations and systems (34A34) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Complexity and performance of numerical algorithms (65Y20)

Related Items (1)

Waveform Relaxation Methods for Lie-Group Equations

Uses Software

• DiffMan

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Time-stepping and preserving orthonormality
• Solving linear ordinary differential equations by exponentials of iterated commutators
• Lie groups and Lie algebras I. Foundations of Lie theory. Lie transformation groups. Transl. from the Russian by A. Kozlowski
• Low-order polynomial approximation of propagators for the time-dependent Schrödinger equation
• A recurrence among the elements of functions of triangular matrices
• On the implementation of the method of Magnus series for linear differential equations
• High order Runge-Kutta methods on manifolds
• Numerical integration of ordinary differential equations on manifolds
• Improved high order integrators based on the Magnus expansion
• Backward error analysis for Lie-group methods
• Volume-preserving algorithms for source-free dynamical systems
• Further ways to approximate the exponential of a matrix
• AN ALGORITHM FOR FAST HIGH PRECISION COMPUTATION OF MATRIX EXPONENTIAL AND LOGARITHM
• Solving Linear Partial Differential Equations by Exponential Splitting
• Efficient Solution of Parabolic Equations by Krylov Approximation Methods
• Nineteen Dubious Ways to Compute the Exponential of a Matrix
• Geometric integration: numerical solution of differential equations on manifolds
• Computations in a free Lie algebra
• On the solution of linear differential equations in Lie groups
• Geometric integration using discrete gradients
• Collocation and Relaxed Collocation for the Fer and the Magnus Expansions
• On the Numerical Integration of Ordinary Differential Equations by Symmetric Composition Methods
• Numerical solution of isospectral flows
• On Krylov Subspace Approximations to the Matrix Exponential Operator
• Exponential Integrators for Large Systems of Differential Equations
• Approximating the exponential from a Lie algebra to a Lie group
• Krylov subspace approximation of eigenpairs and matrix functions in exact and computer arithmetic
• Magnus and Fer expansions for matrix differential equations: the convergence problem
• On Global Representations of the Solutions of Linear Differential Equations as a Product of Exponentials
• On the exponential solution of differential equations for a linear operator
• Construction of Runge-Kutta methods of Crouch-Grossman type of high order

This page was built for publication: Complexity theory for Lie-group solvers