Incomplete partial fractions for parallel evaluation of rational matrix functions
From MaRDI portal
block cyclic reductionincomplete partial fraction representationparallel algorithmPoisson's equationrational matrix functions
Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Finite difference methods for boundary value problems involving PDEs (65N06) Parallel numerical computation (65Y05)
This paper is concerned with the evaluation of \(x:= [p(A)]^{- 1} q(A)b\), when \(p\) and \(q\) are polynomials of the matrix \(A\). Such expressions occur when solving Poisson's equation by block cyclic reduction. If \(p\) is factored in a product of linear factors a sequential algorithm results. A parallel algorithm is obtained by computing the partial fraction representation of \([p(A)]^{- 1}\). However, this algorithm may be unstable. The authors propose a compromise by computing an incomplete partial fraction representation with a small number of factors. Algorithms for computing such representations are presented and analyzed.
Recommendations
Cites work
- A comparison of Crank-Nicolson and Chebyshev rational methods for numerically solving linear parabolic equations
- A direct Method for the Discrete Solution of Separable Elliptic Equations
- A generalized ADI iterative method
- A PARALLEL ALGORITHM FOR THE MATRIX SIGN FUNCTION
- A Parallel and Vector Variant of the Cyclic Reduction Algorithm
- A parallel block cyclic reduction algorithm for the fast solution of elliptic equations
- A Scheme for Parallelizing Certain Algorithms for the Linear Inhomogeneous Heat Equation
- An algorithm for the incomplete decomposition of a rational function into partial fractions
- Application of JMN Approximants to Numerical Initial-value Problems in Linear Differential-algebraic Systems
- Arnoldi methods for large Sylvester-like observer matrix equations, and an associated algorithm for partial spectrum assignment
- Chebyshev rational approximations to \(e^{-x}\) in \([0,+\infty)\) and applications to heat-conduction problems
- Diagonal Padé Approximations for Initial Value Problems
- Discretization Errors for Well‐Set Cauchy Problems. I.
- Efficient Solution of Parabolic Equations by Krylov Approximation Methods
- scientific article; zbMATH DE number 440683 (Why is no real title available?)
- scientific article; zbMATH DE number 3143008 (Why is no real title available?)
- scientific article; zbMATH DE number 3881232 (Why is no real title available?)
- scientific article; zbMATH DE number 3989703 (Why is no real title available?)
- scientific article; zbMATH DE number 3716133 (Why is no real title available?)
- scientific article; zbMATH DE number 3738836 (Why is no real title available?)
- scientific article; zbMATH DE number 47822 (Why is no real title available?)
- scientific article; zbMATH DE number 50395 (Why is no real title available?)
- scientific article; zbMATH DE number 50795 (Why is no real title available?)
- scientific article; zbMATH DE number 3587497 (Why is no real title available?)
- scientific article; zbMATH DE number 592768 (Why is no real title available?)
- scientific article; zbMATH DE number 663838 (Why is no real title available?)
- scientific article; zbMATH DE number 1092951 (Why is no real title available?)
- scientific article; zbMATH DE number 781814 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3236236 (Why is no real title available?)
- scientific article; zbMATH DE number 3399816 (Why is no real title available?)
- Marching Algorithms for Elliptic Boundary Value Problems. I: The Constant Coefficient Case
- New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences
- Newton interpolation at Leja points
- Newton Interpolation in Fejer and Chebyshev Points
- On Direct Methods for Solving Poisson’s Equations
- On Higher Order Stable Implicit Methods for Solving Parabolic Partial Differential Equations
- On interpolation by rational functions
- On parallel algorithms for semidiscretized parabolic partial differential equations based on subdiagonal Padé approximations
- On the conditioning of polynomial and rational forms
- On the Parallel Implementation of Implicit Runge–Kutta Methods
- On the use of rational iterative methods for solving large sparse linear systems
- On the zeros and poles of Padè approximants to e^z. III
- On the zeros and poles of Padé approximants to e^z
- Order stars and stability theorems
- Partial fraction expansion without derivative evaluation
- Properties of \(I_{MN}\) and \(J_{MN}\) approximants and applications to numerical inversion of Laplace transforms and initial value problems
- Real pole approximations to the exponential function
- Restricted Padé Approximations to the Exponential Function
- SOME FAST ELLIPTIC SOLVERS ON PARALLEL ARCHITECTURES AND THEIR COMPLEXITIES
- Sur certaines suites liées aux ensembles plans et leur application à la représentation conforme
- Tabulation of Constants for Full Grade I MN Approximants
- The application of Leja points to Richardson iteration and polynomial preconditioning
- The ordering of tridiagonal matrices in the cyclic reduction method for Poisson's equation
- Vector and parallel methods for the direct solution of Poisson's equation
Cited in
(15)- The scaling and modified squaring method for matrix functions related to the exponential
- A recursive algorithm for the incomplete partial fraction decomposition
- Efficient recursive methods for partial fraction expansion of general rational functions
- Talbot quadratures and rational approximations
- Fraction-free computation of matrix rational interpolants and matrix GCDs
- Partial fraction decomposition of matrices and parallel computing
- Efficient mixed rational and polynomial approximation of matrix functions
- Smoothing with positivity-preserving Padé schemes for parabolic problems with nonsmooth data
- On the solution of large Sylvester‐observer equations
- Efficient approximation of functions of some large matrices by partial fraction expansions
- Evaluation of a rational function
- Optimal polynomial approximation to rational matrix functions using the Arnoldi algorithm
- Parallel computation of functions of matrices and their action on vectors for exponential integrators
- On smoothing of the Crank-Nicolson scheme and higher order schemes for pricing barrier options
- Matrices, moments, and rational quadrature
This page was built for publication: Incomplete partial fractions for parallel evaluation of rational matrix functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1899990)
