SPACETIME WAVELET METHOD FOR LINEAR BOUNDARY-VALUE PROBLEMS IN SYLVESTER MATRIX EQUATION FORM

We present a high-order spacetime numerical method for discretizing and solving linear initial-boundary value problems using wavelet-based techniques with user-prescribed error estimates. The spacetime wavelet discretization yields a system of algebraic equations resulting in a Sylvester matrix equation.We solve this system with a global generalized minimal residual (GMRES) method in conjunction with a wavelet-based recursive algorithm to improve convergence. We perform rigorous verification studies using linear partial differential equations (PDEs) with both convective and diffusive terms. The results of these simulations show the high-order convergence rates for the solution and derivative approximations predicted by wavelet theory.We demonstrate the utility of solving the Sylvester equation through comparisons to the commonly-used Kronecker product formulation. We show that our recursive wavelet-based algorithm that generates initial guesses for the iterative global GMRES method improves the performance of the solver.

Authors

Institutions

Publication Details

Journal
International Journal for Multiscale Computational Engineering
Published
2025-01-01
DOI
https://doi.org/10.1615/intjmultcompeng.2025061431
Primary Topic
Statistical and numerical algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

SPACETIME WAVELET METHOD FOR LINEAR BOUNDARY-VALUE PROBLEMS IN SYLVESTER MATRIX EQUATION FORM

Karel Matouš, Cody D. Cochran
International Journal for Multiscale Computational Engineering
Statistical and numerical algorithms
article

SPACETIME WAVELET METHOD FOR LINEAR BOUNDARY-VALUE PROBLEMS IN SYLVESTER MATRIX EQUATION FORM

Karel Matouš, Cody D. Cochran
article en

Abstract

We present a high-order spacetime numerical method for discretizing and solving linear initial-boundary value problems using wavelet-based techniques with user-prescribed error estimates. The spacetime wavelet discretization yields a system of algebraic equations resulting in a Sylvester matrix equation.We solve this system with a global generalized minimal residual (GMRES) method in conjunction with a wavelet-based recursive algorithm to improve convergence. We perform rigorous verification studies using linear partial differential equations (PDEs) with both convective and diffusive terms. The results of these simulations show the high-order convergence rates for the solution and derivative approximations predicted by wavelet theory.We demonstrate the utility of solving the Sylvester equation through comparisons to the commonly-used Kronecker product formulation. We show that our recursive wavelet-based algorithm that generates initial guesses for the iterative global GMRES method improves the performance of the solver.

International Journal for Multiscale Computational EngineeringVol. 23(6)
University of Notre Dame (US)
Openalex Percentile: Top 64%
Statistical and numerical algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.