The Experts below are selected from a list of 9603 Experts worldwide ranked by ideXlab platform

Luca Daniel - One of the best experts on this subject based on the ideXlab platform.

  • A quasi-convex optimization approach to Parameterized Model order reduction
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2008
    Co-Authors: Kin Cheong Sou, Alexandre Megretski, Luca Daniel
    Abstract:

    In this paper, an optimization-based Model order reduction (MOR) framework is proposed. The method involves setting up a quasi-convex program that solves a relaxation of the optimal Hinfin norm MOR problem. The method can generate guaranteed stable and passive reduced Models and is very flexible in imposing additional constraints such as exact matching of specific frequency response samples. The proposed optimization-based approach is also extended to solve the Parameterized Model-reduction problem (PMOR). The proposed method is compared to existing moment matching and optimization-based MOR methods in several examples. PMOR Models for large RF inductors over substrate and power-distribution grid are also constructed.

  • a piecewise linear moment matching approach to Parameterized Model order reduction for highly nonlinear systems
    IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2007
    Co-Authors: Bradley N Bond, Luca Daniel
    Abstract:

    This paper presents a Parameterized reduction technique for highly nonlinear systems. In our approach, we first approximate the nonlinear system with a convex combination of Parameterized linear Models created by linearizing the nonlinear system at points along training trajectories. Each of these linear Models is then projected using a moment-matching scheme into a low-order subspace, resulting in a Parameterized reduced-order nonlinear system. Several options for selecting the linear Models and constructing the projection matrix are presented and analyzed. In addition, we propose a training scheme which automatically selects parameter-space training points by approximating parameter sensitivities. Results and comparisons are presented for three examples which contain distributed strong nonlinearities: a diode transmission line, a microelectromechanical switch, and a pulse-narrowing nonlinear transmission line. In most cases, we are able to accurately capture the parameter dependence over the parameter ranges of plusmn50% from the nominal values and to achieve an average simulation speedup of about 10x.

  • a quasi convex optimization approach to Parameterized Model order reduction
    Design Automation Conference, 2005
    Co-Authors: Alexandre Megretski, Luca Daniel
    Abstract:

    In this paper an optimization based Model order reduction (MOR) framework is proposed. The method involves setting up a quasi-convex program that explicitly minimizes a relaxation of the optimal H/sub /spl infin// norm MOR problem. The method generates guaranteed stable and passive reduced Models and it is very flexible in imposing additional constraints. The proposed optimization approach is also extended to Parameterized Model reduction problem (PMOR). The proposed method is compared to existing moment matching and optimization based MOR methods in several examples. A PMOR Model for a large RF inductor is also constructed.

  • Parameterized Model Order Reduction of Nonlinear Dynamical Systems
    ICCAD-2005. IEEE ACM International Conference on Computer-Aided Design, 2005
    Co-Authors: B Bond, Luca Daniel
    Abstract:

    — In this paper we present a Parameterized reduction technique for non-linear systems. Our approach combines an existing non-Parameterized trajectory piecewise linear method for non-linear systems, with an existing moment matching param-eterized technique for linear systems. Results and comparisons are presented for two examples: an analog non-linear circuit, and a MEM switch.

  • Accelerated optical topography inspection using Parameterized Model order reduction
    IEEE MTT-S International Microwave Symposium Digest 2005., 2005
    Co-Authors: Jung Hoon Lee, Luca Daniel, A. Vithayathil, D. Vasilyev, J. White
    Abstract:

    This paper describes an efficient method for solving an inverse optical scattering problem associated with the optical semiconductor process inspection. The method determines the geometric features of a fabricated structure, from spectroscopic ellipsometry measurements, by combining a Parameterized low-order Model with an optimization algorithm. We make improvements on the polynomial fitting-based Parameterized moment matching technique to extract such Model automatically. Since the resulting Model is inexpensive to evaluate, the method shows large speedup without losing much accuracy: the examples show more than 1000 times speedup with less than 1% error in the final geometric parameter estimation.

Sasha Rubin - One of the best experts on this subject based on the ideXlab platform.

  • Parameterized Model checking of rendezvous systems
    Distributed Computing, 2018
    Co-Authors: Benjamin Aminof, Francesco Spegni, Tomer Kotek, Sasha Rubin, Helmut Veith
    Abstract:

    Parameterized Model checking is the problem of deciding if a given formula holds irrespective of the number of participating processes. A standard approach for solving the Parameterized Model checking problem is to reduce it to Model checking finitely many finite-state systems. This work considers the theoretical power and limitations of this technique. We focus on concurrent systems in which processes communicate via pairwise rendezvous, as well as the special cases of disjunctive guards and token passing; specifications are expressed in indexed temporal logic without the next operator; and the underlying network topologies are generated by suitable formulas and graph operations. First, we settle the exact computational complexity of the Parameterized Model checking problem for some of our concurrent systems, and establish new decidability results for others. Second, we consider the cases where Model checking the Parameterized system can be reduced to Model checking some fixed number of processes, the number is known as a cutoff. We provide many cases for when such cutoffs can be computed, establish lower bounds on the size of such cutoffs, and identify cases where no cutoff exists. Third, we consider cases for which the Parameterized system is equivalent to a single finite-state system (more precisely a Büchi word automaton), and establish tight bounds on the sizes of such automata.

  • Parameterized Model checking of rendezvous systems
    International Conference on Concurrency Theory, 2014
    Co-Authors: Benjamin Aminof, Francesco Spegni, Tomer Kotek, Sasha Rubin, Helmut Veith
    Abstract:

    A standard technique for solving the Parameterized Model checking problem is to reduce it to the classic Model checking problem of finitely many finite-state systems. This work considers some of the theoretical power and limitations of this technique. We focus on concurrent systems in which processes communicate via pairwise rendezvous, as well as the special cases of disjunctive guards and token passing; specifications are expressed in indexed temporal logic without the next operator; and the underlying network topologies are generated by suitable Monadic Second Order Logic formulas and graph operations. First, we settle the exact computational complexity of the Parameterized Model checking problem for some of our concurrent systems, and establish new decidability results for others. Second, we consider the cases that Model checking the Parameterized system can be reduced to Model checking some fixed number of processes, the number is known as a cutoff. We provide many cases for when such cutoffs can be computed, establish lower bounds on the size of such cutoffs, and identify cases where no cutoff exists. Third, we consider cases for which the Parameterized system is equivalent to a single finite-state system (more precisely a Buchi word automaton), and establish tight bounds on the sizes of such automata.

  • CONCUR - Parameterized Model Checking of Rendezvous Systems
    CONCUR 2014 – Concurrency Theory, 2014
    Co-Authors: Benjamin Aminof, Francesco Spegni, Tomer Kotek, Sasha Rubin, Helmut Veith
    Abstract:

    A standard technique for solving the Parameterized Model checking problem is to reduce it to the classic Model checking problem of finitely many finite-state systems. This work considers some of the theoretical power and limitations of this technique. We focus on concurrent systems in which processes communicate via pairwise rendezvous, as well as the special cases of disjunctive guards and token passing; specifications are expressed in indexed temporal logic without the next operator; and the underlying network topologies are generated by suitable Monadic Second Order Logic formulas and graph operations. First, we settle the exact computational complexity of the Parameterized Model checking problem for some of our concurrent systems, and establish new decidability results for others. Second, we consider the cases that Model checking the Parameterized system can be reduced to Model checking some fixed number of processes, the number is known as a cutoff. We provide many cases for when such cutoffs can be computed, establish lower bounds on the size of such cutoffs, and identify cases where no cutoff exists. Third, we consider cases for which the Parameterized system is equivalent to a single finite-state system (more precisely a Buchi word automaton), and establish tight bounds on the sizes of such automata.

  • Parameterized Model checking of token passing systems
    Verification Model Checking and Abstract Interpretation, 2014
    Co-Authors: Benjamin Aminof, Swen Jacobs, Ayrat Khalimov, Sasha Rubin
    Abstract:

    We revisit the Parameterized Model checking problem for token-passing systems and specifications in indexed CTL i?ź\X. Emerson and Namjoshi 1995, 2003 have shown that Parameterized Model checking of indexed CTL i?ź\X in uni-directional token rings can be reduced to checking rings up to some cutoff size. Clarke et al. 2004 have shown a similar result for general topologies and indexed LTL \X, provided processes cannot choose the directions for sending or receiving the token. We unify and substantially extend these results by systematically exploring fragments of indexed CTL i?ź\X with respect to general topologies. For each fragment we establish whether a cutoff exists, and for some concrete topologies, such as rings, cliques and stars, we infer small cutoffs. Finally, we show that the problem becomes undecidable, and thus no cutoffs exist, if processes are allowed to choose the directions in which they send or from which they receive the token.

  • VMCAI - Parameterized Model Checking of Token-Passing Systems
    Lecture Notes in Computer Science, 2014
    Co-Authors: Benjamin Aminof, Swen Jacobs, Ayrat Khalimov, Sasha Rubin
    Abstract:

    We revisit the Parameterized Model checking problem for token-passing systems and specifications in indexed CTL i?ź\X. Emerson and Namjoshi 1995, 2003 have shown that Parameterized Model checking of indexed CTL i?ź\X in uni-directional token rings can be reduced to checking rings up to some cutoff size. Clarke et al. 2004 have shown a similar result for general topologies and indexed LTL \X, provided processes cannot choose the directions for sending or receiving the token. We unify and substantially extend these results by systematically exploring fragments of indexed CTL i?ź\X with respect to general topologies. For each fragment we establish whether a cutoff exists, and for some concrete topologies, such as rings, cliques and stars, we infer small cutoffs. Finally, we show that the problem becomes undecidable, and thus no cutoffs exist, if processes are allowed to choose the directions in which they send or from which they receive the token.

Benjamin Aminof - One of the best experts on this subject based on the ideXlab platform.

  • Parameterized Model checking of rendezvous systems
    Distributed Computing, 2018
    Co-Authors: Benjamin Aminof, Francesco Spegni, Tomer Kotek, Sasha Rubin, Helmut Veith
    Abstract:

    Parameterized Model checking is the problem of deciding if a given formula holds irrespective of the number of participating processes. A standard approach for solving the Parameterized Model checking problem is to reduce it to Model checking finitely many finite-state systems. This work considers the theoretical power and limitations of this technique. We focus on concurrent systems in which processes communicate via pairwise rendezvous, as well as the special cases of disjunctive guards and token passing; specifications are expressed in indexed temporal logic without the next operator; and the underlying network topologies are generated by suitable formulas and graph operations. First, we settle the exact computational complexity of the Parameterized Model checking problem for some of our concurrent systems, and establish new decidability results for others. Second, we consider the cases where Model checking the Parameterized system can be reduced to Model checking some fixed number of processes, the number is known as a cutoff. We provide many cases for when such cutoffs can be computed, establish lower bounds on the size of such cutoffs, and identify cases where no cutoff exists. Third, we consider cases for which the Parameterized system is equivalent to a single finite-state system (more precisely a Büchi word automaton), and establish tight bounds on the sizes of such automata.

  • Parameterized Model checking of rendezvous systems
    International Conference on Concurrency Theory, 2014
    Co-Authors: Benjamin Aminof, Francesco Spegni, Tomer Kotek, Sasha Rubin, Helmut Veith
    Abstract:

    A standard technique for solving the Parameterized Model checking problem is to reduce it to the classic Model checking problem of finitely many finite-state systems. This work considers some of the theoretical power and limitations of this technique. We focus on concurrent systems in which processes communicate via pairwise rendezvous, as well as the special cases of disjunctive guards and token passing; specifications are expressed in indexed temporal logic without the next operator; and the underlying network topologies are generated by suitable Monadic Second Order Logic formulas and graph operations. First, we settle the exact computational complexity of the Parameterized Model checking problem for some of our concurrent systems, and establish new decidability results for others. Second, we consider the cases that Model checking the Parameterized system can be reduced to Model checking some fixed number of processes, the number is known as a cutoff. We provide many cases for when such cutoffs can be computed, establish lower bounds on the size of such cutoffs, and identify cases where no cutoff exists. Third, we consider cases for which the Parameterized system is equivalent to a single finite-state system (more precisely a Buchi word automaton), and establish tight bounds on the sizes of such automata.

  • CONCUR - Parameterized Model Checking of Rendezvous Systems
    CONCUR 2014 – Concurrency Theory, 2014
    Co-Authors: Benjamin Aminof, Francesco Spegni, Tomer Kotek, Sasha Rubin, Helmut Veith
    Abstract:

    A standard technique for solving the Parameterized Model checking problem is to reduce it to the classic Model checking problem of finitely many finite-state systems. This work considers some of the theoretical power and limitations of this technique. We focus on concurrent systems in which processes communicate via pairwise rendezvous, as well as the special cases of disjunctive guards and token passing; specifications are expressed in indexed temporal logic without the next operator; and the underlying network topologies are generated by suitable Monadic Second Order Logic formulas and graph operations. First, we settle the exact computational complexity of the Parameterized Model checking problem for some of our concurrent systems, and establish new decidability results for others. Second, we consider the cases that Model checking the Parameterized system can be reduced to Model checking some fixed number of processes, the number is known as a cutoff. We provide many cases for when such cutoffs can be computed, establish lower bounds on the size of such cutoffs, and identify cases where no cutoff exists. Third, we consider cases for which the Parameterized system is equivalent to a single finite-state system (more precisely a Buchi word automaton), and establish tight bounds on the sizes of such automata.

  • Parameterized Model checking of token passing systems
    Verification Model Checking and Abstract Interpretation, 2014
    Co-Authors: Benjamin Aminof, Swen Jacobs, Ayrat Khalimov, Sasha Rubin
    Abstract:

    We revisit the Parameterized Model checking problem for token-passing systems and specifications in indexed CTL i?ź\X. Emerson and Namjoshi 1995, 2003 have shown that Parameterized Model checking of indexed CTL i?ź\X in uni-directional token rings can be reduced to checking rings up to some cutoff size. Clarke et al. 2004 have shown a similar result for general topologies and indexed LTL \X, provided processes cannot choose the directions for sending or receiving the token. We unify and substantially extend these results by systematically exploring fragments of indexed CTL i?ź\X with respect to general topologies. For each fragment we establish whether a cutoff exists, and for some concrete topologies, such as rings, cliques and stars, we infer small cutoffs. Finally, we show that the problem becomes undecidable, and thus no cutoffs exist, if processes are allowed to choose the directions in which they send or from which they receive the token.

  • VMCAI - Parameterized Model Checking of Token-Passing Systems
    Lecture Notes in Computer Science, 2014
    Co-Authors: Benjamin Aminof, Swen Jacobs, Ayrat Khalimov, Sasha Rubin
    Abstract:

    We revisit the Parameterized Model checking problem for token-passing systems and specifications in indexed CTL i?ź\X. Emerson and Namjoshi 1995, 2003 have shown that Parameterized Model checking of indexed CTL i?ź\X in uni-directional token rings can be reduced to checking rings up to some cutoff size. Clarke et al. 2004 have shown a similar result for general topologies and indexed LTL \X, provided processes cannot choose the directions for sending or receiving the token. We unify and substantially extend these results by systematically exploring fragments of indexed CTL i?ź\X with respect to general topologies. For each fragment we establish whether a cutoff exists, and for some concrete topologies, such as rings, cliques and stars, we infer small cutoffs. Finally, we show that the problem becomes undecidable, and thus no cutoffs exist, if processes are allowed to choose the directions in which they send or from which they receive the token.

Helmut Veith - One of the best experts on this subject based on the ideXlab platform.

  • Parameterized Model checking of rendezvous systems
    Distributed Computing, 2018
    Co-Authors: Benjamin Aminof, Francesco Spegni, Tomer Kotek, Sasha Rubin, Helmut Veith
    Abstract:

    Parameterized Model checking is the problem of deciding if a given formula holds irrespective of the number of participating processes. A standard approach for solving the Parameterized Model checking problem is to reduce it to Model checking finitely many finite-state systems. This work considers the theoretical power and limitations of this technique. We focus on concurrent systems in which processes communicate via pairwise rendezvous, as well as the special cases of disjunctive guards and token passing; specifications are expressed in indexed temporal logic without the next operator; and the underlying network topologies are generated by suitable formulas and graph operations. First, we settle the exact computational complexity of the Parameterized Model checking problem for some of our concurrent systems, and establish new decidability results for others. Second, we consider the cases where Model checking the Parameterized system can be reduced to Model checking some fixed number of processes, the number is known as a cutoff. We provide many cases for when such cutoffs can be computed, establish lower bounds on the size of such cutoffs, and identify cases where no cutoff exists. Third, we consider cases for which the Parameterized system is equivalent to a single finite-state system (more precisely a Büchi word automaton), and establish tight bounds on the sizes of such automata.

  • Parameterized systems in bip design and Model checking
    International Conference on Concurrency Theory, 2016
    Co-Authors: Igor Konnov, Helmut Veith, Tomer Kotek, Qiang Wang, Simon Bliudze, Joseph Sifakis
    Abstract:

    BIP is a component-based framework for system design that has important industrial applications. BIP is built on three pillars: behavior, interaction, and priority. In this paper, we introduce first-order interaction logic (FOIL) that extends BIP to systems Parameterized in the number of components. We show that FOIL captures classical Parameterized architectures such as token-passing rings, cliques of identical components communicating with rendezvous or broadcast, and client-server systems. Although the BIP framework includes efficient verification tools for statically-defined systems, none are available for Parameterized systems with an unbounded number of components. The Parameterized Model checking literature contains a wealth of techniques for systems of classical architectures. However, application of these results requires a deep understanding of Parameterized Model checking techniques and their underlying mathematical Models. To overcome these difficulties, we introduce a framework that automatically identifies Parameterized Model checking techniques applicable to a BIP design. To our knowledge, it is the first framework that allows one to apply prominent Parameterized Model checking results in a systematic way.

  • SMT and POR beat counter abstraction: Parameterized Model checking of threshold-based distributed algorithms
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2015
    Co-Authors: Igor Konnov, Helmut Veith, Josef Widder
    Abstract:

    © Springer International Publishing Switzerland 2015. Automatic verification of threshold-based fault-tolerant distributed algorithms (FTDA) is challenging: they have multiple parameters that are restricted by arithmetic conditions, the number of processes and faults is Parameterized, and the algorithm code is Parameterized due to conditions counting the number of received messages. Recently, we introduced a technique that first applies data and counter abstraction and then runs bounded Model checking (BMC). Given an FTDA, our technique computes an upper bound on the diameter of the system. This makes BMC complete: it always finds a counterexample, if there is an actual error. To verify state-of-the-art FTDAs, further improvement is needed. In this paper, we encode bounded executions over integer counters in SMT. We introduce a new form of offline partial order reduction that exploits acceleration and the structure of the FTDAs. This aggressively prunes the execution space to be explored by the solver. In this way, we verified safety of seven FTDAs that were out of reach before.

  • Parameterized Model checking of rendezvous systems
    International Conference on Concurrency Theory, 2014
    Co-Authors: Benjamin Aminof, Francesco Spegni, Tomer Kotek, Sasha Rubin, Helmut Veith
    Abstract:

    A standard technique for solving the Parameterized Model checking problem is to reduce it to the classic Model checking problem of finitely many finite-state systems. This work considers some of the theoretical power and limitations of this technique. We focus on concurrent systems in which processes communicate via pairwise rendezvous, as well as the special cases of disjunctive guards and token passing; specifications are expressed in indexed temporal logic without the next operator; and the underlying network topologies are generated by suitable Monadic Second Order Logic formulas and graph operations. First, we settle the exact computational complexity of the Parameterized Model checking problem for some of our concurrent systems, and establish new decidability results for others. Second, we consider the cases that Model checking the Parameterized system can be reduced to Model checking some fixed number of processes, the number is known as a cutoff. We provide many cases for when such cutoffs can be computed, establish lower bounds on the size of such cutoffs, and identify cases where no cutoff exists. Third, we consider cases for which the Parameterized system is equivalent to a single finite-state system (more precisely a Buchi word automaton), and establish tight bounds on the sizes of such automata.

  • CONCUR - Parameterized Model Checking of Rendezvous Systems
    CONCUR 2014 – Concurrency Theory, 2014
    Co-Authors: Benjamin Aminof, Francesco Spegni, Tomer Kotek, Sasha Rubin, Helmut Veith
    Abstract:

    A standard technique for solving the Parameterized Model checking problem is to reduce it to the classic Model checking problem of finitely many finite-state systems. This work considers some of the theoretical power and limitations of this technique. We focus on concurrent systems in which processes communicate via pairwise rendezvous, as well as the special cases of disjunctive guards and token passing; specifications are expressed in indexed temporal logic without the next operator; and the underlying network topologies are generated by suitable Monadic Second Order Logic formulas and graph operations. First, we settle the exact computational complexity of the Parameterized Model checking problem for some of our concurrent systems, and establish new decidability results for others. Second, we consider the cases that Model checking the Parameterized system can be reduced to Model checking some fixed number of processes, the number is known as a cutoff. We provide many cases for when such cutoffs can be computed, establish lower bounds on the size of such cutoffs, and identify cases where no cutoff exists. Third, we consider cases for which the Parameterized system is equivalent to a single finite-state system (more precisely a Buchi word automaton), and establish tight bounds on the sizes of such automata.

Francesco Ferranti - One of the best experts on this subject based on the ideXlab platform.

  • Time-domain variability analysis of large circuits with stochastic linear terminations
    2017 IEEE 21st Workshop on Signal and Power Integrity SPI 2017 - Proceedings, 2017
    Co-Authors: Y. Tao, K Guo, Behzad Nouri, Francesco Ferranti, Michel Nakhla, Ramachandra Achar
    Abstract:

    © 2017 IEEE. An non-intrusive technique is proposed for time-domain variability analysis of large circuits with multiple stochastic parameters and stochastic terminations. A stochastic collocation technique is used in combination with a moment matching Parameterized Model order reduction approach and numerical inversion of Laplace transform. Pertinent numerical results validate the proposed method.

  • Global adjoint sensitivity analysis of coupled coils using Parameterized Model order reduction
    2016 IEEE International Symposium on Electromagnetic Compatibility (EMC), 2016
    Co-Authors: Luca De Camillis, Francesco Ferranti, Giulio Antonini, Albert E. Ruehli
    Abstract:

    This paper presents a Parameterized Model order reduction technique for efficient global sensitivity analysis of coupled coils. It is based on the use of Parameterized Models for the electromagnetic matrices and the Krylov matrices of the original and corresponding adjoint systems, and congruence transformations. Numerical results confirm the efficiency and accuracy of the proposed method for global sensitivity analysis over the complete design space of interest.

  • Passivity-Preserving Parameterized Model Order Reduction Using Singular Values and Matrix Interpolation
    IEEE Transactions on Components, 2013
    Co-Authors: Elizabeth Rita Samuel, Francesco Ferranti, Luc Knockaert, Tom Dhaene
    Abstract:

    We present a Parameterized Model order reduction method based on singular values and matrix interpolation. First, a fast technique using grammians is utilized to estimate the reduced order, and then common projection matrices are used to build Parameterized reduced order Models (ROMs). The design space is divided into cells, and a Krylov subspace is computed for each cell vertex Model. The truncation of the singular values of the merged Krylov subspaces from the Models located at the vertices of each cell yields a common projection matrix per design space cell. Finally, the reduced system matrices are interpolated using positive interpolation schemes to obtain a guaranteed passive Parameterized ROM. Pertinent numerical results validate the proposed technique.

  • Interpolation-based Parameterized Model order reduction of delayed systems
    IEEE Transactions on Microwave Theory and Techniques, 2012
    Co-Authors: Francesco Ferranti, Giulio Antonini, Tom Dhaene, Luc Knockaert, Michel Nakhla, Albert E. Ruehli
    Abstract:

    Three-dimensional electromagnetic methods are fundamental tools for the analysis and design of high-speed systems. These methods often generate large systems of equations, and Model order reduction (MOR) methods are used to reduce such a high complexity. When the geometric dimensions become electrically large or signal waveform rise times decrease, time delays must be included in the Modeling. Design space optimization and exploration are usually performed during a typical design process that consequently requires repeated simulations for different design parameter values. Efficient performing of these design activities calls for Parameterized Model order reduction (PMOR) methods, which are able to reduce large systems of equations with respect to frequency and other design parameters of the circuit, such as layout or substrate features. We propose a novel PMOR method for neutral delayed differential systems, which is based on an efficient and reliable combination of univariate Model order reduction methods, a procedure to find scaling and frequency shifting coefficients and positive interpolation schemes. The proposed scaling and frequency shifting coefficients enhance and improve the Modeling capability of standard positive interpolation schemes and allow accurate Modeling of highly dynamic systems with a limited amount of initial univariate Models in the design space. The proposed method is able to provide Parameterized reduced order Models passive by construction over the design space of interest. Pertinent numerical examples validate the proposed PMOR approach.

  • Parameterized reduced order Models with guaranteed passivity using matrix interpolation
    2012 IEEE 16th Workshop on Signal and Power Integrity SPI 2012 - Proceedings, 2012
    Co-Authors: Elizabeth Rita Samuel, Francesco Ferranti, Luc Knockaert, Tom Dhaene
    Abstract:

    We present a novel Parameterized Model order reduction method based on matrix interpolation. The design space is sampled over an estimation grid and for each estimation point a Krylov subspace is computed. A common projection matrix is generated by the truncation of the singular values of the merged Krylov subspaces of all estimation points from the design space. The reduced matrices are then interpolated using positive interpolation schemes to build guaranteed passive Parameterized reduced order Models. The technique is validated by means of a pertinent numerical simulation.