mNo edit summary |
|||
| (6 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
[[Category:method]] | [[Category:method]] | ||
[[Category:parametric | [[Category:parametric]] | ||
==Description== | ==Description== | ||
The method introduced here is described in | The method introduced here is described in <ref name="daniel04"/> and <ref name="feng07"/>, which is an extension of the [[moment-matching method]] for nonparametric systems (see | ||
<ref name="feng13a"/>, <ref name="oda98"/> for moment-matching MOR). The method is applicable for linear parametrized systems, either in frequency domain or in time domain. For example, the parametric system in frequency domain: | |||
<math> | :<math> | ||
(E_0+s_1 E+s_2E_2+\ldots +s_pE_p)x=Bu(s_1,\ldots,s_p), \quad | (E_0+s_1 E+s_2E_2+\ldots +s_pE_p)x=Bu(s_1,\ldots,s_p), \quad | ||
y=Cx, \quad \quad \quad \quad (1) | y=Cx, \quad \quad \quad \quad (1) | ||
| Line 15: | Line 17: | ||
system, respectively. | system, respectively. | ||
To obtain the reduced model in (2), a | To obtain the reduced model in (2), a [[Projection_based_MOR|projection]] matrix | ||
projection matrix <math>V \in \mathbb{R}^{n \times r}, r\ll n</math> has to be computed. | <math>V \in \mathbb{R}^{n \times r}, r\ll n</math> has to be computed. | ||
<math>V^T(E_0+s_1E_1+s_2E_2+\ldots +s_pE_p)Vx=V^TBu(s_1,\ldots,s_p), </math> | :<math>V^T(E_0+s_1E_1+s_2E_2+\ldots +s_pE_p)Vx=V^TBu(s_1,\ldots,s_p), </math> | ||
<math>y=CVx. \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad(2) | :<math>y=CVx. \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad \quad(2) | ||
</math> | </math> | ||
The matrix <math>V</math> is derived by orthogonalizing a number of moment | The matrix <math>V</math> is derived by orthogonalizing a number of moment | ||
matrices of the system in (1) as follows, see | matrices of the system in (1) as follows, see <ref name="daniel04"/> or <ref name="feng07"/>. | ||
By defining <math> | By defining <math> | ||
| Line 31: | Line 33: | ||
we can expand <math>x</math> in (1) at <math>s_1, s_2, \ldots, s_p</math> around <math>p_0=[s_1^0,s_2^0,\cdots,s_p^0]</math> as below, | we can expand <math>x</math> in (1) at <math>s_1, s_2, \ldots, s_p</math> around <math>p_0=[s_1^0,s_2^0,\cdots,s_p^0]</math> as below, | ||
<math> | :<math> | ||
x=[I-(\sigma_1M_1+\ldots +\sigma_pM_p)]^{-1}B_Mu(s_1,\ldots,s_p) | x=[I-(\sigma_1M_1+\ldots +\sigma_pM_p)]^{-1}B_Mu(s_1,\ldots,s_p) | ||
=\sum\limits_{i=0}^{\infty}(\sigma_1M_1+\ldots+\sigma_pM_p)^iB_Mu(s_1,\ldots,s_p). | =\sum\limits_{i=0}^{\infty}(\sigma_1M_1+\ldots+\sigma_pM_p)^iB_Mu(s_1,\ldots,s_p). | ||
| Line 41: | Line 43: | ||
matrices multiplied by <math>C</math> from the left. The matrix <math>V</math> can be | matrices multiplied by <math>C</math> from the left. The matrix <math>V</math> can be | ||
generated by first explicitly computing some of the moment matrices | generated by first explicitly computing some of the moment matrices | ||
and then orthogonalizing them as suggested in | and then orthogonalizing them as suggested in <ref name="daniel04"/>. | ||
The resulting <math>V</math> is desired to expand the subspace: | The resulting <math>V</math> is desired to expand the subspace: | ||
<math> | :<math> | ||
\mathop{\mathrm{range}}\{V\}=\mathop{\mathrm{span}}\{B_M, \ M_1B_M,\ldots, M_pB_M,\ M_1^2B_M, \, (M_1M_2+M_2M_1)B_M, \ldots, (M_1M_p+M_pM_1)B_M, </math> | \mathop{\mathrm{range}}\{V\}=\mathop{\mathrm{span}}\{B_M, \ M_1B_M,\ldots, M_pB_M,\ M_1^2B_M, \, (M_1M_2+M_2M_1)B_M, \ldots, (M_1M_p+M_pM_1)B_M, </math> | ||
<math> | :<math> | ||
M_p^2B_M, M_1^3B_M,\ldots, M_1^rB_M, \ldots,M_p^rB_M \}. \quad \quad \quad \quad (3) | M_p^2B_M, M_1^3B_M,\ldots, M_1^rB_M, \ldots,M_p^rB_M \}. \quad \quad \quad \quad (3) | ||
</math> | </math> | ||
| Line 57: | Line 59: | ||
Instead of directly computing the moment matrices in (3), a | Instead of directly computing the moment matrices in (3), a | ||
numerically robust method is proposed in | numerically robust method is proposed in <ref name="feng07"/> ( the | ||
detailed algorithm is described in | detailed algorithm is described in <ref name="fengXX"/> ), which combines | ||
the recursion in (5) with the modified Gram-Schmidt | the recursion in (5) with the modified Gram-Schmidt | ||
process to implicitly compute the moment matrices. The computed <math>V</math> | process to implicitly compute the moment matrices. The computed <math>V</math> | ||
is actually an orthonormal basis of the subspace as below, | is actually an orthonormal basis of the subspace as below, | ||
<math> | :<math> | ||
\mathop{\mathrm{range}}\{V\}=\mathop{\mathrm{span}}\{R_0, R_1,\ldots, R_r \}. \quad \quad \quad \quad (4) | \mathop{\mathrm{range}}\{V\}=\mathop{\mathrm{span}}\{R_0, R_1,\ldots, R_r \}. \quad \quad \quad \quad (4) | ||
</math> | </math> | ||
<math> R_0 =[B_M],</math> | :<math> R_0 =[B_M],</math> | ||
<math>R_1=[M_1R_0,\ldots, M_pR_0], </math> | :<math>R_1=[M_1R_0,\ldots, M_pR_0], </math> | ||
<math>R_2=[M_1R_1,\ldots, M_pR_1], \quad \quad \quad \quad (5) </math> | :<math>R_2=[M_1R_1,\ldots, M_pR_1], \quad \quad \quad \quad (5) </math> | ||
<math> \vdots,</math> | :<math> \vdots,</math> | ||
<math>R_r=[M_1R_{r-1},\ldots, M_pR_{r-1}]</math> | :<math>R_r=[M_1R_{r-1},\ldots, M_pR_{r-1}]</math> | ||
<math> \vdots.</math> | :<math> \vdots.</math> | ||
Due to the numerical stability properties of | Due to the numerical stability properties of | ||
the repeated modified Gram-Schmidt process employed in | the repeated modified Gram-Schmidt process employed in | ||
<ref name="feng07"/> and <ref name="fengXX"/>, the reduced model derived from <math>V</math> | |||
in (4) is computed in a numerically stable and accurate way. Applications of the method in | in (4) is computed in a numerically stable and accurate way. Applications of the method in <ref name="feng07"/>, <ref name="fengXX"/> to the parametric models [[Gyroscope]], [[Silicon nitride membrane]], and [[Microthruster Unit]], can be found in <ref name="feng13"/>. | ||
==References== | ==References== | ||
<references> | |||
multiparameter moment-matching model-reduction approach for | |||
generating geometrically parameterized interconnect performance | <ref name="daniel04">L. Daniel, O. C. Siong, L. S. Chay, K. H. Lee, and J.~White. "<span class="plainlinks">[http://dx.doi.org/10.1109/TCAD.2004.826583 A multiparameter moment-matching model-reduction approach for generating geometrically parameterized interconnect performance models]</span>", IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst, 22(5): 678--693, 2004.</ref> | ||
models, | |||
Circuits Syst, 22(5): 678--693, 2004. | <ref name="feng07">L. Feng and P. Benner, "<span class="plainlinks">[http://dx.doi.org/10.1002/pamm.200700749 A Robust Algorithm for Parametric Model Order Reduction]</span>", In Proc. Applied Mathematics and Mechanics (ICIAM 2007), 7(1): 10215.01--02, 2007.</ref> | ||
<ref name="fengXX">L. Feng and P. Benner, "<span class="plainlinks">[http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=64CF520F4D47C5E63F6BA178288BE18F?doi=10.1.1.154.4365&rep=rep1&type=pdf A robust algorithm for parametric model order reduction based on implicit moment matching]</span>", submitted.</ref> | |||
<ref name="feng13">L. Feng, P. Benner, J.G Korvink, "<span class="plainlinks">[http://dx.doi.org/10.1002/nme.4449 Subspace recycling accelerates the parametric macromodeling of MEMS]</span>", International Journal for Numerical Methods in Engineering, 94(1): 84-110, 2013.</ref> | |||
<ref name="feng13a">L. Feng, P. Benner, and J.G Korvink, "<span class="plainlinks">[http://dx.doi.org/%2010.1002/9783527647132.ch3 System-level modeling of MEMS by means of model order reduction (mathematical approximation)--mathematical background]</span>". In T. Bechtold, G. Schrag, and L. Feng, editors, System-Level Modeling of MEMS, Advanced Micro & Nanosystems. ISBN 978-3-527-31903-9, Wiley-VCH, 2013.</ref> | |||
<ref name="oda98">A. Odabasioglu, M. Celik, and L. T. Pileggi, "<span class="plainlinks">[http://dx.doi.org/10.1109/ICCAD.1997.643366 PRIMA: passive reduced-order interconnect macromodeling algorithm]</span>", IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.,17(8):645--654,1998.</ref> | |||
</references> | |||
Latest revision as of 08:34, 22 May 2013
Description
The method introduced here is described in [1] and [2], which is an extension of the moment-matching method for nonparametric systems (see [3], [4] for moment-matching MOR). The method is applicable for linear parametrized systems, either in frequency domain or in time domain. For example, the parametric system in frequency domain:
where is the frequency domain variable, is the frequency. are the parameters of the system. They can be any scalar functions of some source parameters, like , where is time, or combinations of several physical (geometrical) parameters like , where and are two independent physical (geometrical) parameters. is the state vector, and are the inputs and outputs of the system, respectively.
To obtain the reduced model in (2), a projection matrix has to be computed.
The matrix is derived by orthogonalizing a number of moment matrices of the system in (1) as follows, see [1] or [2].
By defining and , we can expand in (1) at around as below,
Here . We call the coefficients in the above series expansion moment matrices of the parametrized system, i.e. . The corresponding moments of the transfer function are those moment matrices multiplied by from the left. The matrix can be generated by first explicitly computing some of the moment matrices and then orthogonalizing them as suggested in [1]. The resulting is desired to expand the subspace:
However, does not really span the whole subspace, because the latterly computed vectors in the subspace become linearly dependent due to numerical instability. Therefore, with this matrix one cannot get an accurate reduced model which matches all the moments algebraically included in the subspace.
Instead of directly computing the moment matrices in (3), a numerically robust method is proposed in [2] ( the detailed algorithm is described in [5] ), which combines the recursion in (5) with the modified Gram-Schmidt process to implicitly compute the moment matrices. The computed is actually an orthonormal basis of the subspace as below,
Due to the numerical stability properties of the repeated modified Gram-Schmidt process employed in [2] and [5], the reduced model derived from in (4) is computed in a numerically stable and accurate way. Applications of the method in [2], [5] to the parametric models Gyroscope, Silicon nitride membrane, and Microthruster Unit, can be found in [6].
References
- ↑ 1.0 1.1 1.2 L. Daniel, O. C. Siong, L. S. Chay, K. H. Lee, and J.~White. "A multiparameter moment-matching model-reduction approach for generating geometrically parameterized interconnect performance models", IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst, 22(5): 678--693, 2004.
- ↑ 2.0 2.1 2.2 2.3 2.4 L. Feng and P. Benner, "A Robust Algorithm for Parametric Model Order Reduction", In Proc. Applied Mathematics and Mechanics (ICIAM 2007), 7(1): 10215.01--02, 2007.
- ↑ L. Feng, P. Benner, and J.G Korvink, "System-level modeling of MEMS by means of model order reduction (mathematical approximation)--mathematical background". In T. Bechtold, G. Schrag, and L. Feng, editors, System-Level Modeling of MEMS, Advanced Micro & Nanosystems. ISBN 978-3-527-31903-9, Wiley-VCH, 2013.
- ↑ A. Odabasioglu, M. Celik, and L. T. Pileggi, "PRIMA: passive reduced-order interconnect macromodeling algorithm", IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.,17(8):645--654,1998.
- ↑ 5.0 5.1 5.2 L. Feng and P. Benner, "A robust algorithm for parametric model order reduction based on implicit moment matching", submitted.
- ↑ L. Feng, P. Benner, J.G Korvink, "Subspace recycling accelerates the parametric macromodeling of MEMS", International Journal for Numerical Methods in Engineering, 94(1): 84-110, 2013.