Results 111 to 120 of about 42,588 (304)
Some matrix completion problems
Let F be a field and let n , p 1 , p 2
openaire +1 more source
Realizability of Polytopes as a Low Rank Matrix Completion Problem [PDF]
This article gives necessary and sufficient conditions for a relation to be the containment relation between the facets and vertices of a polytope. Also given here, are a set of matrices parameterizing the linear moduli space and another set parameterizing the projective moduli space of a combinatorial polytope.
openaire +2 more sources
Ultrasmall High‐Entropy Materials: Nanoscale Effects, Synthesis, and Mechanistic Insights
This review article focuses on sub‐10 nm high‐entropy materials that combine nanoscale design with complex compositions for next‐generation applications. ABSTRACT Ultrasmall high‐entropy nanomaterials (USHENMs, <10 nm) merge multicomponent chemistry with size‐dependent effects, forming a distinct class of materials with unprecedented properties.
Yueyue He +5 more
wiley +1 more source
Matrix Completion With Noise [PDF]
On the heels of compressed sensing, a new field has very recently emerged. This field addresses a broad range of problems of significant practical interest, namely, the recovery of a data matrix from what appears to be incomplete, and perhaps even ...
Plan, Yaniv, Candès, Emmanuel J.
core
Singularity Degree of the Positive Semidefinite Matrix Completion Problem [PDF]
The singularity degree of a semidefinite programming problem is the smallest number of facial reduction steps to make the problem strictly feasible. We introduce two new graph parameters, called the singularity degree and the nondegenerate singularity degree, based on the singularity degree of the positive semidefinite matrix completion problem.
openaire +2 more sources
A robust plant protein adhesive was prepared by fabricating a bi‐continuous organic–inorganic hybrid structure. Compared with traditional organic–inorganic hybrid adhesives, the addition amount of inorganic phase is increased from 0.2%–3.0% to 50%, and the strength and toughness are increased by 6 and 121 times, respectively.
Zheng Liu +10 more
wiley +1 more source
Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming
. Given a partial symmetric matrix A with only certain elements specified, the Euclidean distance matrix completion problem (EDMCP) is to find the unspecified elements of A that make A a Euclidean distance matrix (EDM).
Abdo Y. Alfakih, Henry Wolkowicz
core
Low rank matrix completion by alternating steepest descent methods
Matrix completion involves recovering a matrix from a subset of its entries by utilizing interdependency between the entries, typically through low rank structure.
Tanner, J +5 more
core +1 more source
Assessment of attractiveness of the wine-production industry in the Czech Republic
The paper is focused on evaluation of attractiveness of the wine sector in the Czech Republic and on the competitive position assessment of company Věstonické sklepy, s. r. o. using the assessment of key factors and applying the GE matrix.
Helena Hejmalová, Radka Šperková
doaj +1 more source
Advances in Sustainable and Wearable Textile Based Soft Robotics
This Review examines advances in wearable textile‐based soft robotics, focusing on sustainable materials, integrated sensing, and scalable actuation. It discusses manufacturing and system integration across healthcare, assistive robotics, prosthetics, and human–machine interfaces, and highlights key challenges in circular design, including life‐cycle ...
Zahir Abbas +6 more
wiley +1 more source

