1996Numerical Linear Algebra with ApplicationsRequires access

Piecewise Polynomial Solutions Without a priori Break Points

Per Christian Hansen, Klaus Mosegaard

Open publisher page 29 citations

Abstract

In certain inverse problems it is useful to be able to compute solutions which are, in some sense, as simple as possible. For example,k one may wish to compute solutions which are piecewise constant and with as few discontinuities as possible. Such solutions are suited to describe models, e.g., geological layers, where the coarse structure is more important than the fine structure. A natural generalization of piecewise constant functions is piecewise polynomial solutions. In this paper we present a new algorithm which is capable of computing solutions that are piecewise polynomials, without having to specify a priori the positions of the break points between the polynomial pieces.

About this research paper

What this paper is about

In certain inverse problems it is useful to be able to compute solutions which are, in some sense, as simple as possible. For example,k one may wish to compute solutions which are piecewise constant and with as few discontinuities as possible. Such solutions are suited to describe models, e.g., geological layers, where the coarse structure is more important than the fine structure. A natural generalization of piecewise constant functions is piecewise polynomial solutions. In this paper we present a new algorithm which is capable of computing solutions that are piecewise polynomials, without having to specify a priori the positions of the break points between the polynomial pieces.

Why it matters

OpenAlex reports 29 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In certain inverse problems it is useful to be able to compute solutions which are, in some sense, as simple as possible. For example,k one may wish to compute solutions which are piecewise constant and with as few discontinuities as possible. Such solutions are suited to describe models, e.g., geological layers, where the coarse structure is more important than the fine structure. A natural generalization of piecewise constant functions is piecewise polynomial solutions. In this paper we present a new algorithm which is capable of computing solutions that are piecewise polynomials, without having to specify a priori the positions of the break points between the polynomial pieces.

Key concepts: Piecewise, Mathematics, Polynomial, Classification of discontinuities, Constant (computer programming), Simple (philosophy), A priori and a posteriori, Generalization

Related papers

Back to paper searchBrowse research topicsOriginal source
Piecewise Polynomial Solutions Without a priori Break Points — Research Paper | ScholarLens