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

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

Journal: :Multiscale Modeling & Simulation 2008
Sébastien Boyaval

We consider the computation of averaged coefficients for the homogenization of elliptic partial differential equations. In this problem, like in many multiscale problems, a large number of similar computations parametrized by the macroscopic scale is required at the microscopic scale. This is a framework very much adapted to model order reduction attempts. The purpose of this work is to show ho...

2014
Silvan Sievers Martin Wehrle Malte Helmert

Bounded Intention Planning (BIP) [7] is a pruning approach for optimal planning with unary operators. BIP has the flavor of partial order reduction, which has recently found increasing interest for optimal planning [4, 6]. However, although BIP is claimed to be a variant of stubborn sets [3] in the original paper, no proof is given for this claim. In this paper, we shed light on the relationshi...

2016
Lihong Feng Yao Yue Nicodemus Banagaaya Peter Meuris Wim Schoenmaker Peter Benner

In this work, we discuss the parametric modeling for the (electro)-thermal analysis of components of nanoelectronic structures and automatic model order reduction of the consequent parametric models. Given the system matrices at different values of the parameters, we introduce a simple method of extracting system matrices which are independent of the parameters, so that parametric models of a c...

1992
Yung-Ta Li Zhaojun Bai Wen-Wei Lin Yangfeng Su

Article history: Received 3 June 2010 Accepted 5 July 2011 Available online 20 August 2011 Submitted by V. Mehrmann Dedicated to Danny Sorensen on the occasion of his 65th birthday

Journal: :IACR Cryptology ePrint Archive 2006
Ayan Mahalanobis

In this paper we study the MOR cryptosystem. We use the group of unitriangular matrices over a finite field as the non-abelian group in the MOR cryptosystem. We show that a cryptosystem similar to the El-Gamal cryptosystem over finite fields can be built using the proposed groups and a set of automorphisms of these groups. We also show that the security of this proposed MOR cryptosystem is equi...

1997
Mattan Kamon Nuno Marques L. Miguel Silveira Jacob White

In the past, model order reduction techniques have been successfully employed for 3-D PEEC interconnect models. This paper explores the diiculties in generating low order models when PEEC-like models include volume laments to accurately capture skin and proximity eeects.

2014

The author presented a method for model order reduction of large-scale time-invariant systems in time domain. In this approach, two modified Hankel matrices are suggested for getting reduced order models. The proposed method is simple, efficient and retains stability feature of the original high order system. The viability of the method is illustrated through the examples taken from literature....

Journal: :CoRR 2007
Ayan Mahalanobis

The MOR cryptosystem [9] is a natural generalization of the El-Gamal cryptosystem to non-abelian groups. Using a p-group, a cryptosystem was built in [4]. It seems resoanable to assume the cryptosystem is as secure as the El-Gamal cryptosystem over finite fields. A natural question arises can one make a better cryptosystem using p-groups? In this paper we show that the answer is no.

Journal: :Journal of Physics: Complexity 2020

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

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