نتایج جستجو برای: geometric approach

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

In this article the general non-symmetric parametric form of the incremental secant stiffness matrix for nonlinear analysis of solids have been investigated to present a semi analytical sensitivity analysis approach for geometric nonlinear shape optimization. To approach this aim the analytical formulas of secant stiffness matrix are presented. The models were validated and used to perform inve...

1999
Anuj Srivastava

| This paper presents a geometric approach to estimating subspaces as elements of complex Grassmann-manifold, with each subspace represented by its unique, complex projection matrix. Variation between the sub-spaces is modeled by rotating their projection matrices via the action of unitary matrices (elements of the unitary group (U(n))). Subspace estimation or tracking then corresponds to the i...

2001
Erich-Peter Klement Radko Mesiar Endre Pap

In analogy to the representation of the standard probabilistic average as an expected value of a random variable, a geometric approach to aggregation is proposed. Several properties of such aggregation operators are investigated, and the relationship with distinguished classes of aggregation operators is discussed.

Journal: :Chaos 2011
Nihat Ay Eckehard Olbrich Nils Bertschinger Jürgen Jost

We develop a geometric approach to complexity based on the principle that complexity requires interactions at different scales of description. Complex systems are more than the sum of their parts of any size and not just more than the sum of their elements. Using information geometry, we therefore analyze the decomposition of a system in terms of an interaction hierarchy. In mathematical terms,...

2006
Vladik Kreinovich Piotr Wojciechowski Alexander D. Alexandrov

Interactions that explain quark confinement correspond, in the first approximation, to interactions in 2-D space-time. In this paper, we show that this fact has a geometric explanation: Namely, • on the most fundamental geometric level (of causality relations) quark confinement means that causality forms a lattice (i.e., an ordering in which every two events have the least upper bound and the g...

1999
Richard Montgomery Michail Zhitomirskii

A Goursat flag is a chain Ds ⊂ Ds−1 ⊂ D1 ⊂ D0 = TM of subbundles of the tangent bundle TM such that corank Di = i and Di−1 is generated by the vector fields in Di and their Lie brackets. Engel, Goursat, and Cartan studied these flags and established a normal form for them, valid at generic points of M . Recently Kumpera, Ruiz and Mormul discovered that Goursat flags can have singularities, and ...

1998
David Helmbold

AdaBoost is a popular and eeective leveraging procedure for improving the hypotheses generated by weak learning algorithms. AdaBoost and many other leveraging algorithms can be viewed as performing a constrained gradient descent over a potential function. At each iteration the distribution over the sample given to the weak learner is the direction of steepest descent. We introduce a new leverag...

2007
B. H. Strulovici

We consider the comparative statics of solutions to parameterized optimization problems. A geometric method is developed for finding a vector field that, at each point in the parameter space, indicates a direction in which monotone comparative statics obtains. Given such a vector field, we provide sufficient conditions under which the problem can be reparameterized on the parameter space (or a ...

Journal: :J. Global Optimization 2015
Konrad Kulakowski Katarzyna Grobler-Debska Jaroslaw Was

Heuristic Rating Estimation (HRE) is a newly proposed method supporting decisions analysis based on the use of pairwise comparisons. It allows that the ranking values of some alternatives (herein referred to as concepts) are initially known, whilst the ranks for the other concepts have yet to be estimated. To calculate the missing ranks it is assumed that the priority of every single concept ca...

Journal: :SIAM J. Discrete Math. 1995
Benny Chor Madhu Sudan

An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie inside the interval defined by the other two. The order of the other two points (i.e., which one is the largest and which one is the smallest) is not specified. This problem comes up in questions related to physical mapp...

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

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