Coefficient identification in Euler–Bernoulli equation from over-posed data

A method for solving the inverse problem for coefficient identification in the Euler–Bernoulli equation from over-posed data is presented. The original inverse problem is replaced by a minimization problem. The method is applied to the problem for identifying the coefficient in the case when it is a...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computational and applied mathematics 2010-11, Vol.235 (2), p.450-459
Main Authors: Marinov, Tchavdar T., Marinova, Rossitza S.
Format: Article
Language:English
Subjects:
Approximation
Calculus of variations and optimal control
Coefficient identification
Coefficients
Computer simulation
Euler-Bernoulli equation
Exact sciences and technology
Imbeddings
Inverse problem
Inverse problems
Mathematical analysis
Mathematical models
Mathematics
Method of Variational Imbedding
Numerical analysis
Numerical analysis in abstract spaces
Numerical analysis. Scientific computation
Numerical methods in mathematical programming, optimization and calculus of variations
Numerical methods in optimization and calculus of variations
Optimization
Partial differential equations
Sciences and techniques of general use
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A method for solving the inverse problem for coefficient identification in the Euler–Bernoulli equation from over-posed data is presented. The original inverse problem is replaced by a minimization problem. The method is applied to the problem for identifying the coefficient in the case when it is a piece-wise polynomial function. Several examples are elaborated and the numerical results confirm that the solution of the imbedding problem coincides with the direct simulation of the original problem within the second order of approximation.
ISSN:0377-0427
1879-1778
DOI:10.1016/j.cam.2010.05.048