搜索结果: 16-30 共查到“知识库 线性代数”相关记录652条 . 查询时间(1.046 秒)
A Nonlinear Reconstruction Algorithm from Absolute Value of Frame Coefficients for Low Redundancy Frames
Nonlinear Reconstruction Algorithm Absolute Value of Frame Coefficients Low Redundancy Frames
2015/9/29
In this paper we present a signal reconstruction algorithm from absolute value of frame coefficients that requires arelatively low redundancy. The basic idea is to use a nonlinear embedding of the inp...
Equivalence of Reconstruction from the Absolute Value of the Frame Coefficients to a Sparse Representation Problem
frames nonlinear processing sparse representation
2015/9/29
The purpose of this note is to prove, for real frames, that signal reconstruction from the absolute value ofthe frame coefficients is equivalent to solution of a sparse signal optimization problem, na...
THE NONCOMMUTATIVE WIENER LEMMA,LINEAR INDEPENDENCE,AND SPECTRAL PROPERTIES OF THE ALGEBRA OF TIME-FREQUENCY SHIFT OPERATORS
NONCOMMUTATIVE WIENER LEMMA LINEAR INDEPENDENCE SPECTRAL PROPERTIES OF THE ALGEBRA TIME-FREQUENCY SHIFT OPERATORS
2015/9/29
In this paper we analyze the Banach *-algebra of time-frequency shifts with absolutely summable coefficients. We prove a noncommutative version of the Wiener lemma. We also construct a faithful tracia...
Linear Bandits in High Dimension and Recommendation Systems
Services automation browsing space
2015/8/21
A large number of online services provide automated recommendations to help users to navigate through a large collection of items. New items (products, videos, songs, advertisements) are suggested on ...
Under Martin’s Axiom a c.c.c. nonseparable compact space is constructed which maps continuously into [0, 1] with linear fibers. Such a space can not, for instance, map onto [0, 1]ℵ1.
PROPER FORCING,CARDINAL ARITHMETIC,AND UNCOUNTABLE LINEAR ORDERS
PROPER FORCING CARDINAL ARITHMETIC UNCOUNTABLE LINEAR ORDERS
2015/8/17
In this paper I will communicate some new consequences of the Proper Forcing Axiom. First, the Bounded Proper Forcing Axiom implies that there is a well ordering of R which is Σ1-definable in (H(ω2), ...
A FIVE ELEMENT BASIS FOR THE UNCOUNTABLE LINEAR ORDERS
FIVE ELEMENT BASIS UNCOUNTABLE LINEAR ORDERS
2015/8/17
In this paper I will show that it is relatively consistent with the usual axioms of mathematics (ZFC) together with a strong form of the axiom of infinity (the existence of a supercompact cardinal) th...
ω1 and −ω1 May Be the Only Minimal Uncountable Linear Orders
ω1 and − ω1 May Only Minimal Uncountable Linear Orders
2015/8/17
In 1971 Laver proved the following result, confirming a long-standing conjecture of Fraïssé. Theorem 1.1 [10]. If Li (i < ω) is a sequence of σ-scattered linear orders, then there exist i < j suc...
In this paper I will survey some recent developments in the combinatorics of Aronszajn trees. I will cover work on coherent and Lipschitz trees, the basis problem for uncountable linear orderings, sub...
BOUNDING THE CONSISTENCY STRENGTH OF A FIVE ELEMENT LINEAR BASIS
CONSISTENCY STRENGTH FIVE ELEMENT LINEAR BASIS
2015/8/17
In [13] it was demonstrated that the Proper Forcing Axiom implies that there is a five element basis for the class of uncountable linear orders. The assumptions needed in the proof have consistency st...
In this paper we will characterize—under appropriate axiomatic assumptions — when a linear order is minimal with respect to not being a countable union of scattered suborders. We show that, assuming P...
A bisection method for computing the H_infinity-norm of a transfer matrix and related problems
Transfer matrix singular value assessment the Hamiltonian matrix characteristic values of linear algebra
2015/8/13
Inspired by recent work of Byers we establish a simple connection between the singular values of a transfer matrix evaluated along the imaginary axis and the imaginary eigenvalues of a related Hamilto...
Computation of the maximum H_infinity-norm of parameter-dependent linear systems by a branch and bound algorithm
Calculation algorithm parameter linear system a branch and bound algorithm linear system
2015/8/12
For linear systems that contain unspecified parameters that lie in given intervals, we present a branch and bound algorithm for computing the maximum H_infinity-norm over the set of uncertain paramete...
Computation of the worst-case covariance for linear systems with uncertain parameters
Uncertain parameters of linear systems linear systems branch and bound algorithm is calculated
2015/8/12
For a class of linear systems with unknown parameters that lie in intervals, we present a branch and bound algorithm for computing the worst-case covariance of the state.
Closed-loop convex analysis of performance limits for linear control systems
Linear control system computer aided control system and design a linear controller convex optimization digital signal processor
2015/8/12
In closed-loop convex analysis and design, the linear controller design problem is reformulated as a convex optimization problem, which may be more easily solved than the problems resulting from conve...