搜索结果: 46-60 共查到“知识库 计算数学”相关记录1183条 . 查询时间(4.465 秒)
Let M be a random nα × n matrix of rank r ≪ n, and assume that a uniformly random subset E of its entries is observed. We describe an efficient algorithm that reconstructs M from |E| = O(r ...
The LASSO risk for gaussian matrices
Noisy linear observation vector image processing the matrix sequence
2015/8/20
We consider the problem of learning a coecient vector x0 2 R N from noisy linear observation y = Ax0 + w 2 R n. In many contexts (ranging from model selection to image processing) it is desirable to ...
Localization from Incomplete Noisy Distance Measurements
Noise the measurement the sensor network localization nuclear magnetic resonance protein conformation
2015/8/20
We consider the problem of positioning a cloud of points in the Euclidean space R d, using noisy measurements of a subset of pairwise distances. This task has applications in various areas, such as se...
THE SANDPILE GROUP OF A TREE
SANDPILE GROUP TREE
2015/8/14
A wired tree is a graph obtained from a tree by collapsing the leaves to a single vertex. We describe a pair of short exact sequences relating the sandpile group of a wired tree to the sandpile groups...
SANDPILE GROUPS AND SPANNING TREES OF DIRECTED LINE GRAPHS
SANDPILE GROUPS SPANNING TREES DIRECTED LINE GRAPHS
2015/8/14
We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associated to a directed graph, whose...
We give an algorithm that computes the final state of certain growth models without computing all intermediate states. Our technique is based on a “least action principle” which characterizes the odom...
Numerical solution of a two-disk problem
Numerical solution control system and feedback compensator Fahrenheit convex programming numerical Fahrenheit programming
2015/8/12
A multidisk problem in frequency domain control system synthesis is a problem in which the designer wishes to find a feedback compensator that minimizes the H_infty-norm of a certain transfer matrix r...
Computing bounds for the structured singular value via an interior point algorithm
Calculation structure singular value the interior point algorithm
2015/8/12
We describe an interior point algorithm for computing the upper bound for the structured singular value described in the paper by Fan, Tits and Doyle, IEEE Trans AC, Jan. 1991. We demonstrate the perf...
Numerical methods for H_2 related problems
Numerical convex programming quantity convex programming application
2015/8/12
Recent results have shown that several H_2 and H_2-related problems can be formulated as convex programs with a finite number of variables. We present an interior point algorithm for the solution of t...
Closed-loop convex formulation of classical and singular value loop shaping
Singular value circulation formation control dynamic systems digital technology application control system design
2015/8/12
We show that control system design via classical loop shaping and singular value loop shaping can be formulated as a closed-loop convex problem. Consequently, loop shaping problems can be solved by ef...
Antenna array pattern synthesis via convex optimization
Antenna array model numerical geometric shape elements value
2015/8/11
We show that a variety of antenna array pattern synthesis problems can be expressed as convex optimization problems, which can be (numerically) solved with great efficiency by recently developed inter...
Dynamic emission tomography - regularization and inversion
Emission tomography subtracting the poison radon pathology emission source static pathological inverse
2015/8/11
The problem of emission tomography, inverting the attenuated Radon transform, is moderately ill-posed if the unknown emission source is static. Here we consider the case where the emission source is d...
Generalized Chebyshev bounds via semidefinite programming
Quadratic inequality convex optimization computation single variable and random variable chebyshev inequality
2015/8/10
A sharp lower bound on the probability of a set defined by quadratic inequalities, given the first two moments of the distribution, can be efficiently computed using convex optimization. This result g...
Robust efficient frontier analysis with a separable uncertainty model
The mean - variance model effective portfolio construction model parameters return on assets uncertainty analysis and numerical examples
2015/8/10
Mean-variance (MV) analysis is often sensitive to model mis-specification or uncertainty, meaning that the MV efficient portfolios constructed with an estimate of the model parameters (i.e., the expec...
Filter design with low complexity coefficients
Heuristic design low complexity coefficient filters with nonzero number the filter coefficients
2015/8/10
We introduce a heuristic for designing filters that have low complexity coefficients, as measured by the total number of nonzeros digits in the binary or canonic signed digit (CSD) representations of ...