Complexity of an algorithm for solving saddle-point systems with singular blocks arising in wavelet-Galerkin discretizations.

DOI10.1007/S10492-005-0018-YMaRDI QIDQ851679zbMATHOpenAlexFDO

Authors Radek Kucera

Publication date 21 November 2006

Published in Applications of Mathematics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/33222

zbMATH Keywords

fictitious domain methodsaddle-point systemwavelet-Galerkin discretization

Mathematics Subject Classification ID

Numerical methods for wavelets (65T60) Iterative numerical methods for linear systems (65F10) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Adaptive wavelet methods for saddle point problems
• Numerical solution of saddle point problems
• Fast iterative solution of saddle point problems in optimal control based on wavelets
• scientific article; zbMATH DE number 641545
• Adaptive Wavelet Methods for Saddle Point Problems---Optimal Convergence Rates

Cites work

• scientific article; zbMATH DE number 3833218 (Why is no real title available?)
• scientific article; zbMATH DE number 1022658 (Why is no real title available?)
• A fictitious domain method for Dirichlet problem and applications
• Mixed and Hybrid Finite Element Methods
• On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem
• Ten Lectures on Wavelets

Cited in

(2)

• Fictitious domain formulations of unilateral problems: analysis and algorithms
• A Smooth Embedding Domain Method Based On the Penalty Approach

This page was built for publication: Complexity of an algorithm for solving saddle-point systems with singular blocks arising in wavelet-Galerkin discretizations.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q851679)