Optimal trigonometric preconditioners for elliptic and queueing problems
finite difference approximationpreconditioned conjugate gradient method2-queue Markovian networksprobability distribution vectorsine or cosine transforms
Probabilistic methods, stochastic differential equations (65C99) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12) Boundary value problems for second-order elliptic equations (35J25) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Finite difference methods for boundary value problems involving PDEs (65N06)
- Optimal trigonometric preconditioners for nonsymmetric Toeplitz systems
- Optimal Bounds for Solving Tridiagonal Systems with Preconditioning
- A preconditioner for elliptic PDE-constrained optimization problems
- Optimal preconditioners for Toeplitz matrices associated with the odd trigonometric transforms
- scientific article; zbMATH DE number 1126864
- Some preconditioners for elliptic PDE-constrained optimization problems
- Optimal Equivalent Preconditioners
- A new preconditioner for elliptic PDE-constrained optimization problems
- scientific article; zbMATH DE number 434790
- Optimal and Superoptimal Circulant Preconditioners
- Fast transforms for tridiagonal linear equations
- Scientific applications of iterative Toeplitz solvers
- Optimal trigonometric preconditioners for nonsymmetric Toeplitz systems
- Preconditioning of elliptic problems by approximation in the transform domain
- Circulant approximation for preconditioning in stochastic automata networks
This page was built for publication: Optimal trigonometric preconditioners for elliptic and queueing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815618)
