On Preconditioned Iterative Methods for Burgers Equations
From MaRDI portal
Publication:5444260
DOI10.1137/060649124zbMath1144.65034OpenAlexW2089384293MaRDI QIDQ5444260
Yu-Mei Huang, Michael Kwok-Po Ng, Zhong Zhi Bai
Publication date: 25 February 2008
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9499fe4ec9966606c7eefc524b7293bc1cbb8ab0
numerical examplesBurgers equationNewton methodpreconditionersGMRES methodfixed-point methodToeplitz-like matricessinc-Galerkin discretization
Numerical computation of solutions to systems of equations (65H10) KdV equations (Korteweg-de Vries equations) (35Q53) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs (65M60)
Related Items
High-order integral nodal discontinuous Gegenbauer-Galerkin method for solving viscous Burgers' equation, Newton-based matrix splitting iteration methods for the weakly nonlinear system, On sinc discretization and banded preconditioning for linear third-order ordinary differential equations, Band-Times-Circulant Preconditioners for Non-Symmetric Real Toeplitz Systems with Unknown Generating Function, Preconditioned CG Methods for a Variable-Coefficient Nonlocal Diffusion Model, A new single-step iteration method for solving complex symmetric linear systems, AQTTTS-based iteration methods for weakly nonlinear systems with diagonal-plus-Toeplitz structure, Efficient single-step preconditioned HSS iteration methods for complex symmetric linear systems, On normal and skew-Hermitian splitting iteration methods for large sparse continuous Sylvester equations, Numerical algorithms for corner-modified symmetric Toeplitz linear system with applications to image encryption and decryption, On sinc discretization method and block-tridiagonal preconditioning for second-order differential-algebraic equations, Comparative study on order-reduced methods for linear third-order ordinary differential equations, On CSCS-based iteration methods for Toeplitz system of weakly nonlinear equations, Matrix multisplitting Picard-iterative method for solving generalized absolute value matrix equation, A Class of Preconditioned TGHSS-Based Iteration Methods for Weakly Nonlinear Systems, The Explicit Inverses of CUPL-Toeplitz and CUPL-Hankel Matrices, Preconditioned Positive-Definite and Skew-Hermitian Splitting Iteration Methods for Continuous Sylvester Equations AX + XB = C, An Efficient Numerical Method for Mean Curvature-Based Image Registration Model, A class of iteration methods based on the generalized preconditioned Hermitian and skew-Hermitian splitting for weakly nonlinear systems, Block-triangular preconditioning methods for linear third-order ordinary differential equations based on reduced-order sinc discretizations, A generalization of the Hermitian and skew-Hermitian splitting iteration method for solving Sylvester equations, A class of iteration methods based on the HSS for Toeplitz systems of weakly nonlinear equations, The accelerated gradient based iterative algorithm for solving a class of generalized Sylvester-transpose matrix equation, Explicit group inverse of an innovative patterned matrix, On refinement of the generalized Bendixson theorem, A generalized modified Hermitian and skew-Hermitian splitting (GMHSS) method for solving complex Sylvester matrix equation, Cyclic displacements and decompositions of inverse matrices for CUPL Toeplitz matrices, A new parameter-free method for Toeplitz systems of weakly nonlinear equations, On LPMHSS-based iteration methods for a class of weakly nonlinear systems, Modified Newton-PHSS method for solving nonlinear systems with positive definite Jacobian matrices, On order-reducible sinc discretizations and block-diagonal preconditioning methods for linear third-order ordinary differential equations, Efficient preconditioned NHSS iteration methods for solving complex symmetric linear systems, Developing the CGLS algorithm for the least squares solutions of the general coupled matrix equations, On preconditioned normal and skew-Hermitian splitting iteration method for continuous Sylvester equations AX + XB = C*
