Results 61 to 70 of about 44,174 (262)
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
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 +3 more sources
DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS [PDF]
AbstractIn this paper, we give general recommendations for successful application of the Douglas–Rachford reflection method to convex and nonconvex real matrix completion problems. These guidelines are demonstrated by various illustrative examples.
Artacho, Francisco J. Aragón +2 more
openaire +5 more sources
A Q‐Learning Algorithm to Solve the Two‐Player Zero‐Sum Game Problem for Nonlinear Systems
A Q‐learning algorithm to solve the two‐player zero‐sum game problem for nonlinear systems. ABSTRACT This paper deals with the two‐player zero‐sum game problem, which is a bounded L2$$ {L}_2 $$‐gain robust control problem. Finding an analytical solution to the complex Hamilton‐Jacobi‐Issacs (HJI) equation is a challenging task.
Afreen Islam +2 more
wiley +1 more source
Matrix pencils completion problems II
[For part I see the author, ibid. 428, No.~1, 259--304 (2008; Zbl 1131.15010).] The paper deals with the matrix pencils completion problem. This problem analyzes the existence of a matrix pencil with prescribed Kronecker invariants and a regular subpencil. Specifically, the author studies the following problem: Let \(A(\lambda) \in F[\lambda]^{n \times
openaire +1 more source
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice +2 more
wiley +1 more source
In this work we dealt with matrix completion problem. This problem arises in different fields, for example, systems and control theory, image processing and collaborative filtering. Given a probabilistic matrix factorization model, we present an approach
Anaís Frangeline Acuña Sosa +1 more
doaj
A simplified thermoplastic pultrusion model is developed to predict thermal fields in glass fiber/polyethylene terephthalate (GF/PET) composites with reduced computational cost. By combining effective material homogenization, validation against literature data, and Gaussian‐process‐based optimization, the study reveals how heating limits, pulling speed,
Elder Soares +3 more
wiley +1 more source
The unusually ultra-deep and ultra-high-pressure gas reservoirs in the Keshen 8 Block on the Kelasu structural belt of the Tarim Basin are also featured by high temperature, well-developed fault fissures, huge thickness, tight matrix, complex oil–water ...
Tongwen Jiang +2 more
doaj +1 more source
Experiments and thermophysical simulations were conducted to investigate the electron beam powder bed fusion electron beam (PBF‐EB/M) process for the γ′‐strengthened nickel‐based superalloy Inconel 738LC. The results demonstrate the impact of process‐induced microstructural variations on high‐temperature mechanical behavior, providing a basis for ...
Jan Niklas Petenati +11 more
wiley +1 more source

