Iterative - interpolation algorithms for L 2 model reduction ∗ by
نویسندگان
چکیده
This paper is concerned with the construction of reduced–order models for high–order linear systems in such a way that the L2 norm of the impulse–response error is minimized. Two convergent algorithms that draw on previous procedures presented by the same authors, are suggested: one refers to s–domain representations, the other to time–domain state–space representations. The algorithms are based on an iterative scheme that, at any step, satisfies certain interpolation constraints deriving from the optimality conditions. To make the algorithms suitable to the reduction of very large–scale systems, resort is made to Krylov subspaces and Arnoldi’s method. The performance of the reduction algorithms is tested on two benchmark examples.
منابع مشابه
Artifact reduction techniques in Cone Beam Computed Tomography (CBCT) imaging modality
Introduction: Cone beam computed tomography (CBCT) was introduced and became more common based on its low cost, fast image procedure rate and low radiation dose compared to CT. This imaging modality improved diagnostic and treatment-planning procedures by providing three-dimensional information with greatly reduced level of radiation dose compared to 2D dental imaging modalitie...
متن کاملModel Order Reduction for Strictly Passive and Causal Distributed
This paper presents a class of algorithms suitable for model reduction of distributed systems. Distributed systems are not suitable for treatment by standard model-reduction algorithms such as PRIMA, PVL, and the Amoldi schemes because they generate matrices that are dependent on frequency (or other parameters) and cannot be put in a lumped or state-space form. Our algorithms build on well-know...
متن کاملAdaptive Rational Interpolation: Arnoldi and Lanczos-like Equations
The Arnoldi and Lanczos algorithms, which belong to the class of Krylov subspace methods, are increasingly used for model reduction of large scale systems. The standard versions of the algorithms tend to create reduced order models that poorly approximate low frequency dynamics. Rational Arnoldi and Lanczos algorithms produce reduced models that approximate dynamics at various frequencies. This...
متن کاملApplication of Fuzzy Bicubic Splines Interpolation for Solving Two-Dimensional Linear Fuzzy Fredholm Integral Equations
In this paper, firstly, we review approximation of fuzzy functions by fuzzy bicubic splines interpolation and present a new approach based on the two-dimensional fuzzy splines interpolation and iterative method to approximate the solution of two-dimensional linear fuzzy Fredholm integral equation (2DLFFIE). Also, we prove convergence analysis and numerical stability analysis ...
متن کاملTitle : Reconstruction of sparsely - sampled dynamic MRI data using Iterative “ Error Energy ” [ 1 ] Reduction
Introduction A well-known reconstruction technique developed by Gerchberg, based on “error energy” reduction [1], is extended in this study to sparsely sampled dynamic cardiac magnetic resonance imaging (CMRI). A-priori knowledge of static and dynamic regions in the FOV is used to sample a subset of phase-encoding views on a regular Cartesian grid, allowing a reduction in overall imaging time. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009