搜索结果: 1-15 共查到“linear equations”相关记录26条 . 查询时间(0.14 秒)
Improved upper bounds for the expected circuit complexity of dense systems of linear equations over GF(2)
Gate complexity linear systems dense matrices
2017/3/6
Minimizing the Boolean circuit implementation of a given cryptographic function is an important issue. A number of papers [12,13,11,5] only consider cancellation-free straight-line programs for produc...
Solving Linear Equations Modulo Unknown Divisors: Revisited
Lattice-based analysis Linear modular equations RSA
2016/1/9
We revisit the problem of finding small solutions to a collection
of linear equations modulo an unknown divisor p for a known
composite integer N. In CaLC 2001, Howgrave-Graham introduced an
effici...
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 ...
Algorithm 937: MINRES-QLP for Symmetric and Hermitian Linear Equations and Least-Squares Problems
Symmetric Hermitian Linear
2015/7/3
If the system is singular, MINRES-QLP computes the unique
minimum-length solution (also known as the pseudoinverse solution), which generally eludes MINRES. In
all cases, it overcomes a potential in...
SOLUTION OF SPARSE LINEAR EQUATIONS USING CHOLESKY FACTORS OF AUGMENTED SYSTEMS
sparse linear equations direct methods unsymmetric matrices
2015/7/3
Cholesky factorizations have reached a high peak of e±ciency for solving sparse
symmetric systems, largely because their Analyze and Factor phases do not con°ict. We explore the
possibility of using...
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.
Small Linearization: Memory Friendly Solving of Non-Linear Equations over Finite Fields
MQ problem Algebraic Attacks Equation Solver
2012/6/14
Solving non-linear and in particular Multivariate Quadratic equations over finite fields is an important cryptanalytic problem. Apart from needing exponential time in general, we also need very large ...
Small Linearization: Memory Friendly Solving of Non-Linear Equations over Finite Fields
implementation / MQ problem Algebraic Attacks Equation Solver F5 Buchberger
2012/3/20
Solving non-linear and in particular Multivariate Quadratic equations over finite fields is an important cryptanalytic problem. Apart from needing exponential time in general, we also need very large ...
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...
Small Linearization: Memory Friendly Solving of Non-Linear Equations over Finite Fields
implementation / MQ problem Algebraic Attacks Equation Solver
2012/8/28
Solving non-linear and in particular Multivariate Quadratic equations over finite fields is an important cryptanalytic problem. Apart from needing exponential time in general, we also need very large ...
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...