35,733 research outputs found
Causal and stable reduced-order model for linear high-frequency systems
With the ever-growing complexity of high-frequency systems in the electronic industry, formation of reduced-order models of these systems is paramount. In this reported work, two different techniques are combined to generate a stable and causal representation of the system. In particular, balanced truncation is combined with a Fourier series expansion approach. The efficacy of the proposed combined method is shown with an example
A partitioned model order reduction approach to rationalise computational expenses in multiscale fracture mechanics
We propose in this paper an adaptive reduced order modelling technique based
on domain partitioning for parametric problems of fracture. We show that
coupling domain decomposition and projection-based model order reduction
permits to focus the numerical effort where it is most needed: around the zones
where damage propagates. No \textit{a priori} knowledge of the damage pattern
is required, the extraction of the corresponding spatial regions being based
solely on algebra. The efficiency of the proposed approach is demonstrated
numerically with an example relevant to engineering fracture.Comment: Submitted for publication in CMAM
emgr - The Empirical Gramian Framework
System Gramian matrices are a well-known encoding for properties of
input-output systems such as controllability, observability or minimality.
These so-called system Gramians were developed in linear system theory for
applications such as model order reduction of control systems. Empirical
Gramian are an extension to the system Gramians for parametric and nonlinear
systems as well as a data-driven method of computation. The empirical Gramian
framework - emgr - implements the empirical Gramians in a uniform and
configurable manner, with applications such as Gramian-based (nonlinear) model
reduction, decentralized control, sensitivity analysis, parameter
identification and combined state and parameter reduction
Order Reduction of the Chemical Master Equation via Balanced Realisation
We consider a Markov process in continuous time with a finite number of
discrete states. The time-dependent probabilities of being in any state of the
Markov chain are governed by a set of ordinary differential equations, whose
dimension might be large even for trivial systems. Here, we derive a reduced
ODE set that accurately approximates the probabilities of subspaces of interest
with a known error bound. Our methodology is based on model reduction by
balanced truncation and can be considerably more computationally efficient than
the Finite State Projection Algorithm (FSP) when used for obtaining transient
responses. We show the applicability of our method by analysing stochastic
chemical reactions. First, we obtain a reduced order model for the
infinitesimal generator of a Markov chain that models a reversible,
monomolecular reaction. In such an example, we obtain an approximation of the
output of a model with 301 states by a reduced model with 10 states. Later, we
obtain a reduced order model for a catalytic conversion of substrate to a
product; and compare its dynamics with a stochastic Michaelis-Menten
representation. For this example, we highlight the savings on the computational
load obtained by means of the reduced-order model. Finally, we revisit the
substrate catalytic conversion by obtaining a lower-order model that
approximates the probability of having predefined ranges of product molecules.Comment: 12 pages, 6 figure
Improved parallelization techniques for the density matrix renormalization group
A distributed-memory parallelization strategy for the density matrix
renormalization group is proposed for cases where correlation functions are
required. This new strategy has substantial improvements with respect to
previous works. A scalability analysis shows an overall serial fraction of 9.4%
and an efficiency of around 60% considering up to eight nodes. Sources of
possible parallel slowdown are pointed out and solutions to circumvent these
issues are brought forward in order to achieve a better performance.Comment: 8 pages, 4 figures; version published in Computer Physics
Communication
Computing Heavy Elements
Reliable calculations of the structure of heavy elements are crucial to
address fundamental science questions such as the origin of the elements in the
universe. Applications relevant for energy production, medicine, or national
security also rely on theoretical predictions of basic properties of atomic
nuclei. Heavy elements are best described within the nuclear density functional
theory (DFT) and its various extensions. While relatively mature, DFT has never
been implemented in its full power, as it relies on a very large number (~
10^9-10^12) of expensive calculations (~ day). The advent of leadership-class
computers, as well as dedicated large-scale collaborative efforts such as the
SciDAC 2 UNEDF project, have dramatically changed the field. This article gives
an overview of the various computational challenges related to the nuclear DFT,
as well as some of the recent achievements.Comment: Proceeding of the Invited Talk given at the SciDAC 2011 conference,
Jul. 10-15, 2011, Denver, C
- âŠ