Jump to ContentJump to Main Navigation

Online

249,00 € / $374.00*

* Prices subject to change. Shipping costs will be added if applicable.
Publication Date:
August 2006
ISSN:
1569-3945
DOI:
10.1515/156939406778247589

See all formats and pricing

Online
Individual Subscription Online only
Euro [D] 249.00
RRP for USA, Canada, Mexico
US$ 374.00 *
Print
Individual Subscription Online only
Euro [D] 1686.00
RRP for USA, Canada, Mexico
US$ 2529.00 *
Print + Online
Individual Subscription Online only
Euro [D] 2024.00
RRP for USA, Canada, Mexico
US$ 3035.00 *
*Prices subject to change. Shipping costs will be added if applicable.

Editor-in-Chief: Kabanikhin, Sergey I.

6 Issues per year

IMPACT FACTOR 2011: 0.432

Mathematical Citation Quotient 2011: 0.40

VolumeIssuePage

Issues

Iterative methods for data assimilation for Burgers' equation

J. Lundvall / V. Kozlov / P. Weinerfelt

Department of Mathematics, Linköpings Universitet, SE-581 83 Linköping, Sweden. E-mails: johlu@mai.liu.se, vlkoz@mai.liu.se

Aeronautical Engineering, Saab Aerosystems, SE-581 88 Linköping, Sweden. E-mail: per.weinerfelt@saab.se

Citation Information: Journal of Inverse and Ill-posed Problems jiip. Volume 14, Issue 5, Pages 505–535, ISSN (Online) 1569-3953, ISSN (Print) 0928-0219, DOI: 10.1515/156939406778247589,

Publication History:
Published Online:

In this paper we consider one-dimensional flow governed by Burgers' equation. We analyze two iterative methods for data assimilation problem for this equation. One of them so called adjoint optimization method, is based on minimization in L 2-norm. We show that this minimization problem is ill-posed but the adjoint optimization iterative method is regularizing, and represents the well-known Landweber method in inverse problems. The second method is based on L 2-minimization of the gradient. We prove that this problem always has a solution. We present numerical comparisons of these two methods.

Comments (0)

Please log in or register to comment.