Results 1  10
of
13,905
Circular domain Computational domain Boundary conditions Inversion
"... SchwarzChristoffel function Inverse of a function Motto: Il est vrai que le monde visible seroit plus parfeit, si le terres & le mers faisoient de figure plus juste. (Malebranche 1707) ..."
Abstract
 Add to MetaCart
SchwarzChristoffel function Inverse of a function Motto: Il est vrai que le monde visible seroit plus parfeit, si le terres & le mers faisoient de figure plus juste. (Malebranche 1707)
NUMERICAL COMPUTATION OF THE SCHWARZCHRISTOFFEL TRANSFORMATION*
"... Abstract. A program is described which computes SchwarzChristoffel transformations that map the unit disk conformally onto the interior of a bounded or unbounded polygon in the complex plane. The inverse map is also computed. The computational problem is approached by setting up a nonlinear system ..."
Abstract
 Add to MetaCart
Abstract. A program is described which computes SchwarzChristoffel transformations that map the unit disk conformally onto the interior of a bounded or unbounded polygon in the complex plane. The inverse map is also computed. The computational problem is approached by setting up a nonlinear system
Gradient projection for sparse reconstruction: Application to compressed sensing and other inverse problems
 IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING
, 2007
"... Many problems in signal processing and statistical inference involve finding sparse solutions to underdetermined, or illconditioned, linear systems of equations. A standard approach consists in minimizing an objective function which includes a quadratic (squared ℓ2) error term combined with a spa ..."
Abstract

Cited by 539 (17 self)
 Add to MetaCart
Many problems in signal processing and statistical inference involve finding sparse solutions to underdetermined, or illconditioned, linear systems of equations. A standard approach consists in minimizing an objective function which includes a quadratic (squared ℓ2) error term combined with a
Functions and their basic properties
 JOURNAL OF FORMALIZED MATHEMATICS
, 2003
"... The definitions of the mode Function and the graph of a function are introduced. The graph of a function is defined to be identical with the function. The following concepts are also defined: the domain of a function, the range of a function, the identity function, the composition of functions, the ..."
Abstract

Cited by 1336 (32 self)
 Add to MetaCart
, the 11 function, the inverse function, the restriction of a function, the image and the inverse image. Certain basic facts about functions and the notions defined in the article are proved.
Relations and their basic properties
 Journal of Formalized Mathematics
, 1989
"... Summary. We define here: mode Relation as a set of pairs, the domain, the codomain, and the field of relation; the empty and the identity relations, the composition of relations, the image and the inverse image of a set under a relation. Two predicates, = and ⊆, and three functions, ∪, ∩ and \ are ..."
Abstract

Cited by 1060 (6 self)
 Add to MetaCart
Summary. We define here: mode Relation as a set of pairs, the domain, the codomain, and the field of relation; the empty and the identity relations, the composition of relations, the image and the inverse image of a set under a relation. Two predicates, = and ⊆, and three functions
Fast Folding and Comparison of RNA Secondary Structures (The Vienna RNA Package)
"... Computer codes for computation and comparison of RNA secondary structures, the Vienna RNA package, are presented, that are based on dynamic programming algorithms and aim at predictions of structures with minimum free energies as well as at computations of the equilibrium partition functions and bas ..."
Abstract

Cited by 809 (117 self)
 Add to MetaCart
Computer codes for computation and comparison of RNA secondary structures, the Vienna RNA package, are presented, that are based on dynamic programming algorithms and aim at predictions of structures with minimum free energies as well as at computations of the equilibrium partition functions
LucasKanade 20 Years On: A Unifying Framework: Part 3
 International Journal of Computer Vision
, 2002
"... Since the LucasKanade algorithm was proposed in 1981 image alignment has become one of the most widely used techniques in computer vision. Applications range from optical flow, tracking, and layered motion, to mosaic construction, medical image registration, and face coding. Numerous algorithms hav ..."
Abstract

Cited by 706 (30 self)
 Add to MetaCart
first consider linear appearance variation when the error function is the Euclidean L2 norm. We describe three different algorithms, the simultaneous, project out, and normalization inverse compositional algorithms, and empirically compare them. Afterwards we consider the combination of linear
SIGNAL RECOVERY BY PROXIMAL FORWARDBACKWARD SPLITTING
 MULTISCALE MODEL. SIMUL. TO APPEAR
"... We show that various inverse problems in signal recovery can be formulated as the generic problem of minimizing the sum of two convex functions with certain regularity properties. This formulation makes it possible to derive existence, uniqueness, characterization, and stability results in a unifi ..."
Abstract

Cited by 509 (24 self)
 Add to MetaCart
We show that various inverse problems in signal recovery can be formulated as the generic problem of minimizing the sum of two convex functions with certain regularity properties. This formulation makes it possible to derive existence, uniqueness, characterization, and stability results in a
Algorithm 785: A software package for computing Schwarz–Christoffel conformal transformation for doubly connected polygonal regions
 ACM Trans. Math. Soft
, 1998
"... A software package implementing SchwarzChristoffel Conformal transformation (or mapping) of doubly connected polygonal regions is fully described in this article from mathematical, numerical, and practical perspectives. The package solves the socalled accessory parameter problem associated with t ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
A software package implementing SchwarzChristoffel Conformal transformation (or mapping) of doubly connected polygonal regions is fully described in this article from mathematical, numerical, and practical perspectives. The package solves the socalled accessory parameter problem associated
Motivation through the Design of Work: Test of a Theory. Organizational Behavior and Human Performance,
, 1976
"... A model is proposed that specifies the conditions under which individuals will become internally motivated to perform effectively on their jobs. The model focuses on the interaction among three classes of variables: (a) the psychological states of employees that must be present for internally motiv ..."
Abstract

Cited by 622 (2 self)
 Add to MetaCart
with ambiguities regarding the processes by which individuals adapt to changing levels in stimulation. Individuals' levels of activation decrease markedly as a function of familiarity with a given stimulus situation. However, after a period of rest, representation of the same stimulus situation will once
Results 1  10
of
13,905