搜索结果: 1-15 共查到“理学 linear equations”相关记录16条 . 查询时间(0.754 秒)
POINTWISE A POSTERIORI ERROR ESTIMATES FOR MONOTONE SEMI-LINEAR EQUATIONS
residual maximum norm
2015/12/11
We derive upper and lower a posteriori estimates for the maximum norm error in nite element solutions of monotone semi-linear equations.
The estimates hold for Lagrange elements of any xed order, n...
Sparse Solution of Underdetermined Linear Equations by Stagewise Orthogonal Matching Pursuit
compressed sensing decoding error-correcting codes
2015/8/21
Finding the sparsest solution to underdetermined systems of linear equations y = Φx is NP-hard
in general. We show here that for systems with ‘typical’/‘random’ Φ, a good approximation to the
sparse...
Sparse Nonnegative Solution of Underdetermined Linear Equations by Linear Programming
Neighborly Polytopes Cyclic Polytopes
2015/8/21
Consider an underdetermined system of linear equations y = Ax with known d×n matrix
A and known y. We seek the sparsest nonnegative solution, i.e. the nonnegative x with fewest
nonzeros satisfying y...
Neighborly Polytopes and Sparse Solution of Underdetermined Linear Equations
Centrosymetric Polytopes Centrally-Neighborly Polytopes
2015/8/21
Consider a d × n matrix A, with d < n. The problem of solving for x in y = Ax is
underdetermined, and has many possible solutions (if there are any). In several fields it is
of interest to ...
For Most Large Underdetermined Systems of Linear Equations the Minimal ` 1 -norm Solution is also the Sparsest Solution
Solution of Underdetermined Linear Systems Overcomplete Representations
2015/8/21
We consider linear equations y = Φα where y is a given vector in R
n
, Φ is a given n by m
matrix with n < m ≤ An, and we wish to solve for α ∈ Rm. We suppose that the columns
of Φ are normalized ...
Semi-linear equations and principal eigenvalues in unbounded domains
Semi-linear equations principal eigenvalues unbounded domains
2015/4/3
Semi-linear equations and principal eigenvalues in unbounded domains.
The solution space geometry of random linear equations
solution space geometry random linear equations Data Structures and Algorithms
2011/10/9
Abstract: We consider random systems of linear equations over GF(2) in which every equation binds k variables. We obtain a precise description of the clustering of solutions in such systems. In partic...
Iteration Procedure for the N-Dimensional System of Linear Equations
linear system iteration hyperplane convergence
2011/3/4
A simple iteration methodology for the solution of a set of a linear algebraic equations is pre-sented. The explanation of this method is based on a pure geometrical interpretation and pictorial repre...
Variable time amplitude amplification and a faster quantum algorithm for solving systems of linear equations
amplitude faster quantum algorithm equations
2010/11/8
We present two new quantum algorithms. Our first algorithm is a generalization of amplitude amplification to the case when parts of the quantum algorithm that is being amplified stop at different time...
An Asymptotic for the Number of Solutions to Linear Equations in Prime Numbers from Specified Chebotarev Classes
symptotic for the Number of Solutions to Linear Equations Prime Numbers Specified Chebotarev Classes
2010/12/1
An Asymptotic for the Number of Solutions to Linear Equations in Prime Numbers from Specified Chebotarev Classes.
Reproducing kernel method for solving systems of linear equations
Exact solution system of linear equations
2010/9/17
A new method for finding the exact solutions of systems of linear equations is presented. Advantage of this method is the simplicity of the procedure. There are no additional constraint conditions. Th...
In this paper, disturbed sparse linear equations over the 0-1
finite field are considered. Due to the special structure of the
problem, the standard alternating coordinate method can be
implemented...
In this paper, we consider solving dense linear equations on Dawning1000
by using matrix partitioning technique. Based on this partitioning of
matrix, we give a parallel block LU decomposition metho...
Fast Elimination of Redundant Linear Equations and Reconstruction of Recombination-Free Mendelian Inheritance on a Pedigree
Recombination-Free Mendelian Inheritance Pedigree
2012/11/29
Computational inference of haplotypes from genotypes has attracted a great deal of attention in the computational biology community recently, partially driven by the interna- tional HapMap project. In...
ON A LINEAR EQUATIONS METHOD OF NONLINEAR POLYNOMIAL EQUATIONS-SOLVING
Equations-solving nonlinear methods cha
2007/8/7
A method for solving nonlinear polynomial equations is given which avoids the appearance of redundant factors as in the previous characteristic set method developed by the present author. The new meth...