Results 231 to 240 of about 32,516 (266)

Randomized algorithms in numerical linear algebra

Acta Numerica, 2017
This survey provides an introduction to the use of randomization in the design of fast algorithms for numerical linear algebra. These algorithms typically examine only a subset of the input to solve basic problems approximately, including matrix multiplication, regression and low-rank approximation. The survey describes the key ideas and gives complete
Kannan, Ravindran, Vempala, Santosh
openaire   +2 more sources

Sensitivity analysis of random linear differential–algebraic equations using system norms

Journal of Computational and Applied Mathematics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pulch, Roland   +2 more
openaire   +2 more sources

Visual cryptograms of random grids via linear algebra

Multimedia Tools and Applications, 2017
Two visual models of image secret sharing have been studied: visual cryptography schemes (VCS), introduced by Naor and Shamir, and visual cryptograms of random grids (VCRG), introduced by Kafri and Keren. VCRG has gained much attention in academia than before to avoid the pixel expansion of VCS. Although there is a strict relation between VCRG and VCS,
Gang Shen, Feng Liu, Zhengxin Fu, Bin Yu
openaire   +1 more source

Systems of Linear Algebraic Equations with Random Coefficients

Theory of Probability & Its Applications, 1992
See the review Zbl 0732.60074.
openaire   +1 more source

Application of laser speckle to randomized numerical linear algebra

Optical Data Science: Trends Shaping the Future of Photonics, 2018
We propose and simulate integrated optical devices for accelerating numerical linear algebra (NLA) calculations. Data is modulated on chirped optical pulses and these propagate through a multimode waveguide where speckle provides the random projections needed for NLA dimensionality reduction.
Leif Johannson   +5 more
openaire   +1 more source

Topics in Randomized Numerical Linear Algebra

2013
This thesis studies three classes of randomized numerical linear algebra algorithms, namely: (i) randomized matrix sparsification algorithms, (ii) low-rank approximation algorithms that use randomized unitary transformations, and (iii) low-rank approximation algorithms for positive-semidefinite (PSD) matrices.
openaire   +1 more source

Generalized model of double random phase encoding based on linear algebra

Optics Communications, 2013
Abstract We propose a generalized model for double random phase encoding (DRPE) based on linear algebra. We defined the DRPE procedure in six steps. The first three steps form an encryption procedure, while the later three steps make up a decryption procedure. We noted that the first (mapping) and second (transform) steps can be generalized.
Kazuya Nakano   +3 more
openaire   +1 more source

POLYNOMIAL CHAOS FOR LINEAR DIFFERENTIAL ALGEBRAIC EQUATIONS WITH RANDOM PARAMETERS

International Journal for Uncertainty Quantification, 2011
Technical applications are often modeled by systems of differential algebraic equations. The systems may include parameters that involve some uncertainties. We arrange a stochastic model for uncertainty quantification in the case of linear systems of differential algebraic equations.
openaire   +1 more source

Random Matrices, Combinatorics, Numerical Linear Algebra and Complex Networks

2012
Abstract : Understanding large, random, matrices is important in many areas of interest to AFORS. These includes the probabilistic analysis of problems in numerical linear algebra, the efficiency of the simplex method in linear programming, the key parameters in statistical sampling, the expansion of complex networks such as the Internet graph, to ...
openaire   +1 more source

Home - About - Disclaimer - Privacy