نتایج جستجو برای: model order reduction

تعداد نتایج: 3171611  

2004
Frank Blömeling Heinrich Voss

Large and sparse rational eigenproblems where the rational term is of low rank k arise in vibrations of fluid–solid structures and of plates with elastically attached loads. Exploiting model order reduction techniques, namely the Padé approximation via block Lanczos method, problems of this type can be reduced to k–dimensional rational eigenproblems which can be solved efficiently by safeguarde...

2012
Maciej Balajewicz Laurens E. Howle Brian P. Mann Henri P. Gavin

Reduced Order Modeling of Turbulent Flows) A New Approach to Model Order Reduction of the Navier-Stokes Equations by Maciej Balajewicz Department of Mechanical Engineering and Materials Science Duke University Date:

2014
C. O. Ania J. Rocha A. P. Carvalho A. Martins

Bifunctional Pt-HMOR catalysts were prepared by incipient wetness impregnation of various desilicated MOR obtained by alkaline treatment using NaOH concentrations ranging from 0.1 to 0.5 M. The zeolite structural changes upon modification were investigated by several techniques including powder X-ray diffraction, Al and Si MAS-NMR spectroscopy, N2 adsorption, pyridine adsorption followed by inf...

2004
A. Megretski

8.1 Setting Up A Model Order Reduction Problem This section describes a number of different ways of setting up a model reduction problem. In contrast with the case of LTI feedback optimization, when the most natural problem formulation has a satisfactory solution (H2 or H-Infinity optimization via Riccati equa­ tions), no efficient solution is known for the most natural formulation of the model...

2017
Narmada Herath Domitilla Del Vecchio

In this paper, we consider the problem of model order reduction for a class of singularly perturbed stochastic differential equations with linear drift terms. We present a reduced-order model that approximates both slow and fast variable dynamics when the time-scale separation is large. Specifically, we show that, on a finite time interval, the moments of all orders of the slow variables for th...

2013
Immanuel Martini Bernard Haasdonk

The Dirichlet-Neumann reduced basis method is a model order reduction method for homogeneous domain decomposition of elliptic PDE’s on a-priori known geometries. It is based on an iterative scheme with full offline-online decomposition and rigorous a-posteriori error estimates. We show that the primal-dual framework for non-compliant output quantities can be transferred to this method. The resu...

1998
Robert P. Kurshan Vladimir Levin Marius Minea Doron A. Peled Hüsnü Yenigün

1 I n t r o d u c t i o n One c o m m o n me thod for dealing with the intrinsically intractable computa t iona l complexi ty of model-checking asynchronous systems is partial order reduction. This reduct ion technique exploits the c o m m o n practice of model ing concurrent events in asynchronous systems as an interleaving of the events in all possible execution orders. An impor t an t observ...

1997
Luı́s Miguel Silveira Mattan Kamon

In this paper we discuss generating low order models for efficient coupled circuitinterconnect simulation. The ever increasing speeds and shrinking feature sizes that are typical of state of the art integrated circuits designs have made coupling due to interconnect and packaging a very important, sometimes dominant, factor in system performance. The ability to efficiently perform coupled circui...

2018
Paulo Ricardo Gherardi HEIN Loïc BRANCHERIAU

COMPARISON BETWEEN THREE-POINT AND FOUR-POINT FLEXURAL TESTS 2 TO DETERMINE WOOD STRENGTH OF EUCALYPTUS SPECIMENS 3 Paulo Ricardo Gherardi HEIN*, Loïc BRANCHERIAU 4 *Corresponding author: [email protected] 5 Received: September 21, 2016 6 Accepted: January 24, 2018 7 Posted online: January 25, 2018 8 9 ABSTRACT 10 11 Comparison between flexural wood strength values obtained from three-poin...

Journal: :CoRR 2014
Ayan Mahalanobis Anupam Singh

This paper is a continuation of the work done to understand the security of a MOR cryptosystem over matrix groups defined over a finite field. In this paper we show that in the case of unitary group U(d, q) the security of the MOR cryptosystem is similar to the hardness of the discrete logarithm problem in Fq2d . In our way of developing the MOR cryptosystem, we developed row-column operations ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید