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

DOI10.1007/S10492-005-0018-YzbMath1099.65150OpenAlexW2046045956MaRDI QIDQ851679

Radek Kučera

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

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

Related Items (2)

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

Cites Work

• A fictitious domain method for Dirichlet problem and applications
• On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem
• Mixed and Hybrid Finite Element Methods
• Ten Lectures on Wavelets
• Unnamed Item
• Unnamed Item

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