Exploiting the sparsity in the solution of linear ordinary differential equations
type: Item
instance of: scholarly article
title: Exploiting the sparsity in the solution of linear ordinary differential equations
zbMATH Open document ID: 0576.65062
DOI: 10.1016/0898-1221(85)90186-5
author: Zahari Zlatev
author: J. Waśniewski
author: Kjeld Schaumburg
publication date: 1985-01-01T00:00:00Z
review text: See the preview in Zbl 0563.65051.
Mathematics Subject Classification ID: 65L05
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65L10
Mathematics Subject Classification ID: 65L20
Mathematics Subject Classification ID: 81V10
Mathematics Subject Classification ID: 34A30
zbMATH DE Number: 3921857
zbMATH Keywords: large systems
zbMATH Keywords: sparse matrix technique
zbMATH Keywords: numerical examples
zbMATH Keywords: Runge-Kutta methods
zbMATH Keywords: Gaussian elimination
zbMATH Keywords: error control
zbMATH Keywords: storage
zbMATH Keywords: scheme
zbMATH Keywords: quasi- Newton iterative process
zbMATH Keywords: iterative refinement
describes a project that uses: NAG
describes a project that uses: DIFSUB
describes a project that uses: Y12M
describes a project that uses: LINPACK
describes a project that uses: MA28
MaRDI profile type: Publication
full work available at URL: 0898-1221(85)90186-5
OpenAlex ID: W2054516435
cites work: Diagonally Implicit Runge–Kutta Methods for Stiff O.D.E.’s
cites work: A special family of Runge-Kutta methods for solving stiff differential equations
cites work: An implementation of singly-implicit Runge-Kutta methods
cites work: A Transformed implicit Runge-Kutta Method
cites work: Q3932291
cites work: Some Design Features of a Sparse Matrix Code
cites work: Q4769371
cites work: Klassische Runge-Kutta-Formeln vierter und niedrigerer Ordnung mit Schrittweiten-Kontrolle und ihre Anwendung auf Wärmeleitungsprobleme
cites work: The automatic integration of ordinary differential equations
cites work: Initial Value Routines in the NAG Library
cites work: Q5674335
cites work: The Potential for Parallelism in Runge–Kutta Methods. Part 1: RK Formulas in Standard Form
cites work: On Some Pivotal Strategies in Gaussian Elimination by Sparse Technique
cites work: Modified Diagonally Implicit Runge–Kutta Methods
cites work: Use of Iterative Refinement in the Solution of Sparse Linear Systems
cites work: Q3945480
cites work: Y12M. Solution of large and sparse systems of linear algebraic equations. Documentation of subroutines
cites work: Comparison of Two Algorithms for Solving Large Linear Systems
cites work: Direct methods for sparse matrices
published in: Computers & Mathematics with Applications
Recommended article: Q3677084
Recommended article: Finding a sparse solution of a class of linear differential equations by solving a nonlinear system
Recommended article: Sparse approximate solution of partial differential equations
Recommended article: Sparse Approximate Solutions to Linear Systems
Recommended article: \(m\)-sparse solution of linear ordinary differential equations with polynomial coefficients
Recommended article: Exact and Approximate Sparse Solutions of Underdetermined Linear Equations
Recommended article: Sparse Solutions of Underdetermined Linear Systems
Recommended article: Sparse Solutions of Underdetermined Linear Systems and Their Applications
Recommended article: Q3560376
Recommended article: Solution of Sparse Underdetermined Systems of Linear Equations
description: scientific article; zbMATH DE number 3921857