This work presents some space decomposition algorithms for a convex minimization problem. The algorithms has linear rate of convergence and the rate of convergence depends only on four constants. The space decomposition could be a multigrid or domain decomposition method. We explain the detailed pro
Dynamic linearization and nonlinear filtering with application to a tracking problem
β Scribed by Harold R. Dessau
- Publisher
- Elsevier Science
- Year
- 1972
- Tongue
- English
- Weight
- 688 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0020-0255
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract A classical result in the theory of monotone operators states that if __C__ is a reflexive Banach space, and an operator __A__: __C__β__C__^\*^ is monotone, semicontinuous and coercive, then __A__ is surjective. In this paper, we define the βdual spaceβ __C__^\*^ of a convex, usually no
The paper describes a theoretical framework for the design of a robust multivariable output tracking controller using sliding mode concepts. The approach assumes that only measured outputs are available and uses a sliding mode observer to reconstruct estimates of the internal system states for use i
We present new decay estimates of solutions for the mixed problem of the equation vtt -vxx + vt = 0, which has the weighted initial data [v . Similar decay estimates are also derived to the Cauchy problem in R N for utt -u+ut = 0 with the weighted initial data. Finally, these decay estimates can be
## Abstract The problem of aligning time series arises naturally in a number of fields, but our investigation is motivated by the problem of extracting a paleoclimatic signal from glacial varve chronologies. Glacial varves are laminated sediments that record annual depositional cycles in certain la