Dual Perturbation Method for Spectral Solution of Block‐Posed Harmonic Problems

ABSTRACT We present a new direct (or quasi‐direct) strategy for solving the three‐dimensional Poisson and Helmholtz problems posed on a Cartesian block subject to Dirichlet boundary conditions. Our approach starts with a spectral approximation of either problem involving modal Chebyshev integration matrices. With the number of Chebyshev modes associated with each of the coordinate directions, the total number of modes is . The relevant complexities for our base methods are then similar to certain classical methods; in particular, a set‐up cost scaling like and, thereafter, an solve cost. The memory storage for our approach is and involves no hierarchical data formats. Our approaches exhibit spectral accuracy and are empirically well‐conditioned. We describe acceleration via the introduction of an iterative element. This acceleration yields a method with an set‐up cost, followed by a sub‐quadratic solve complexity seen empirically to also be . The concluding section remarks on possible further acceleration (not established), targeting set‐up and solve costs.

Authors

Institutions

Publication Details

Journal
Numerical Linear Algebra with Applications
Published
2024-12-25
DOI
https://doi.org/10.1002/nla.2587
Primary Topic
Numerical methods in engineering
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dual Perturbation Method for Spectral Solution of Block‐Posed Harmonic Problems

Stephen R. Lau
Numerical Linear Algebra with Applications
Numerical methods in engineering
article

Dual Perturbation Method for Spectral Solution of Block‐Posed Harmonic Problems

Stephen R. Lau
article en

Abstract

ABSTRACT We present a new direct (or quasi‐direct) strategy for solving the three‐dimensional Poisson and Helmholtz problems posed on a Cartesian block subject to Dirichlet boundary conditions. Our approach starts with a spectral approximation of either problem involving modal Chebyshev integration matrices. With the number of Chebyshev modes associated with each of the coordinate directions, the total number of modes is . The relevant complexities for our base methods are then similar to certain classical methods; in particular, a set‐up cost scaling like and, thereafter, an solve cost. The memory storage for our approach is and involves no hierarchical data formats. Our approaches exhibit spectral accuracy and are empirically well‐conditioned. We describe acceleration via the introduction of an iterative element. This acceleration yields a method with an set‐up cost, followed by a sub‐quadratic solve complexity seen empirically to also be . The concluding section remarks on possible further acceleration (not established), targeting set‐up and solve costs.

Numerical Linear Algebra with ApplicationsVol. 32(1)
University of New Mexico (US)
Openalex Percentile: Top 73%
Numerical methods in engineering
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.

Dual Perturbation Method for Spectral Solution of Block‐Posed Harmonic Problems — Stephen R. Lau · Numerical Linear Algebra with Applications (2024) | TGRS Research Map | TGRS