Mathematical programming techniques to solve biharmonic problems by a recursive projection algorithm

a posteriori estimates a priori estimates biharmonic equation Cauchy problem global approximation by biharmonic polynomials ill-conditioned problem ill-posed problem least squares linear programming numerical comparisons recursive projection algorithm star-shaped domain

Mathematics Subject Classification ID

Biharmonic, polyharmonic functions and equations, Poisson's equation in two dimensions (31A30) Higher-order elliptic equations (35J30) Numerical methods for ill-posed problems for initial value and initial-boundary value problems involving PDEs (65M30) Spectral, collocation and related methods for initial value and initial-boundary value problems involving PDEs (65M70)

Review text

The biharmonic equation \(\Delta^ 2u=0\) is considered on a star-shaped domain \(\Omega\) in the plane, with \(u=f\) and \(\partial_ nu=g\) prescribed on the boundary \(\partial \Omega\). The numerical method consists of global approximation by biharmonic polynomials. A finite number of points \(\theta_ j\) is selected on \(\partial \Omega\), and a recursive projection algorithm is used to minimize the sum \(\sum_{j}\{| u(\theta_ j)-f(\theta_ j)|^ 2+| \partial_ nu(\theta_ j)-g(\theta_ j)|^ 2+| \partial_ tu(\theta_ j)-\partial_ tf(\theta_ j)|^ 2\}.\) Here, \(\partial_ n\) denotes the normal derivative on \(\partial \Omega\), and \(\partial_ t\) the tangential derivative. Computations are presented with varying numbers of basis elements and evaluation points \(\theta_ j\).

Recommendations

Cites work

Cited in

(1)

Sinc-Galerkin method for solving biharmonic problems

This page was built for publication: Mathematical programming techniques to solve biharmonic problems by a recursive projection algorithm

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