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

DOI10.1016/0377-0427(90)90430-8zbMath0721.65053OpenAlexW2059208247MaRDI QIDQ2641093

Michela Redivo-Zaglia, Maria Morandi Cecchi

Publication date: 1990

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(90)90430-8

zbMATH Keywords

linear programminga priori estimatesCauchy problembiharmonic equationleast squaresill-posed problemill-conditioned problemnumerical comparisonsa posteriori estimatesstar-shaped domainrecursive projection algorithmglobal approximation by biharmonic polynomials

Mathematics Subject Classification ID

Spectral, collocation and related methods for initial value and initial-boundary value problems involving PDEs (65M70) 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)

Related Items (1)

Sinc-Galerkin method for solving biharmonic problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive interpolation, extrapolation and projection
• The general Neville-Aitken-algorithm and some applications
• A general extrapolation algorithm
• Algorithm 585: A Subroutine for the General Interpolation and Extrapolation Problems
• The Numerical Solution of Some Biharmonic Problems by Mathematical Programming Techniques
• Numerical Experiments on the Solution of Some Biharmonic Problems by Mathematical Programming Techniques

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