Spelling suggestions: "subject:"bioorthogonal wavelet based"" "subject:"bioorthogonal wavelet cases""
1 |
Adaptive Wavelet Galerkin BEMHarbrecht, Helmut, Schneider, Reinhold 06 April 2006 (has links) (PDF)
The wavelet Galerkin scheme for the fast solution of boundary integral equations produces approximate solutions within discretization error accuracy offered by the underlying Galerkin method at a computational expense that stays proportional to the number of unknowns. In this paper we present an adaptive version of the scheme which preserves the super-convergence of the Galerkin method.
|
2 |
Wavelet Galerkin Schemes for Boundary Integral Equations - Implementation and QuadratureHarbrecht, Helmut, Schneider, Reinhold 06 April 2006 (has links) (PDF)
In this paper we consider the fully discrete wavelet Galerkin scheme for the fast solution of boundary integral equations in three dimensions. It produces approximate solutions within discretization error accuracy offered by the underlying Galerkin method at a computational expense that stays proportional to the number of unknowns. We focus on implementational details of the scheme, in particular on numerical integration of relevant matrix coefficients. We illustrate the proposed algorithms by numerical results.
|
3 |
Adaptive Wavelet Galerkin BEMHarbrecht, Helmut, Schneider, Reinhold 06 April 2006 (has links)
The wavelet Galerkin scheme for the fast solution of boundary integral equations produces approximate solutions within discretization error accuracy offered by the underlying Galerkin method at a computational expense that stays proportional to the number of unknowns. In this paper we present an adaptive version of the scheme which preserves the super-convergence of the Galerkin method.
|
4 |
Wavelet Galerkin Schemes for Boundary Integral Equations - Implementation and QuadratureHarbrecht, Helmut, Schneider, Reinhold 06 April 2006 (has links)
In this paper we consider the fully discrete wavelet Galerkin scheme for the fast solution of boundary integral equations in three dimensions. It produces approximate solutions within discretization error accuracy offered by the underlying Galerkin method at a computational expense that stays proportional to the number of unknowns. We focus on implementational details of the scheme, in particular on numerical integration of relevant matrix coefficients. We illustrate the proposed algorithms by numerical results.
|
Page generated in 0.0651 seconds