Results 71 to 80 of about 42,588 (304)
Distributed Computing Algorithm of Nuclear Norm Minimization for Low-Rank Matrix Completion
This paper investigates a low-rank matrix completion problem aimed at recovering missing entries in large-scale matrices. While low-rank matrix completion has been widely studied and successfully applied in areas such as collaborative filtering, image ...
Katsumi Konishi, Ryohei Sasaki
doaj +1 more source
The elliptic matrix completion problem
The author gives necessary and sufficient conditions on a nonnegative tensor to be diagonally equivalent to a tensor with prescribed slice sum. The following theorem is proved. Let \(H\) be a Hermitian matrix with partioned form \(H=\left[\begin{matrix} A & B\\ B^* & D\end{matrix}\right]\), where \(A\) has order \(r\).
Saleh, Ossama A., Smith, Ronald L.
openaire +2 more sources
Constructing Confidence Sets for the Matrix Completion Problem [PDF]
In the present note we consider the problem of constructing honest and adaptive confidence sets for the matrix completion problem. For the Bernoulli model with known variance of the noise we provide a realizable method for constructing confidence sets that adapt to the unknown rank of the true matrix.
Carpentier, Alexandra +2 more
openaire +2 more sources
Phase Field Failure Modeling: Brittle‐Ductile Dual‐Phase Microstructures under Compressive Loading
The approach by Amor and the approach by Miehe and Zhang for asymmetric damage behavior in the phase field method for fracture are compared regarding their fitness for microcrack‐based failure modeling. The comparison is performed for the case of a dual‐phase microstructure with a brittle and a ductile constituent.
Jakob Huber, Jan Torgersen, Ewald Werner
wiley +1 more source
Data and Task Scheduling in Distributed Computing Environments
Data-aware scheduling in today’s large-scale heterogeneous environments has become a major research and engineering issue. Data Grids (DGs), Data Clouds (DCs) and Data Centers are designed for supporting the processing and analysis of massive data ...
Magdalena Szmajduch
doaj +1 more source
Optimization of the Production of Rubber Compounds Using Mathematical Models
Rubber compounds were mixed in a batch internal mixer, and symbolic regression was used to derive mathematical models linking recipe and process parameters to ram path, torque, and mixing quality (incorporation, dispersion, distribution). Subsequent optimization with evolutionary algorithms identified operating conditions that reduce specific energy ...
Anke Bardehle +7 more
wiley +1 more source
A Unified Framework for Sparse Relaxed Regularized Regression: SR3
Regularized regression problems are ubiquitous in statistical modeling, signal processing, and machine learning. Sparse regression, in particular, has been instrumental in scientific model discovery, including compressed sensing applications, variable ...
Peng Zheng +4 more
doaj +1 more source
The Q-matrix completion problem
A real n x n matrix is a Q-matrix if for every k = 1, 2, . . . ,n the sum of all k x k principal minors is positive. A digraph D is said to have Q-completion if every partial Q-matrix specifying D can be completed to a Q-matrix. For the Q-completion problem, sufficient conditions for a digraph to have Q-completion are given, necessary conditions for a ...
DeAlba, Luz +2 more
openaire +3 more sources
A novel workflow for investigating hydride vapor phase epitaxy for GaN bulk crystal growth is proposed. It combines Design of experiments (DoE) with physical simulations of mass transport and crystal growth kinetics, serving as an intermediate step between DoE and experiments.
J. Tomkovič +7 more
wiley +1 more source
Low rank matrix completion [PDF]
Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2009.Cataloged from PDF version of thesis.Includes bibliographical references (p.
Nan, Feng, S.M. Massachusetts Institute of Technology
core

