Results 61 to 70 of about 111,307 (278)

Restricted strong convexity and weighted matrix completion: Optimal bounds with noise [PDF]

open access: yes, 2010
We consider the matrix completion problem under a form of row/column weighted entrywise sampling, including the case of uniform entrywise sampling as a special case.
Negahban, Sahand, Wainwright, Martin J.
core   +1 more source

THE NORM AND THE LOGARITHMIC NORM OF INFINITE MATRICES

open access: yesTambov University Reports. Series: Natural and Technical Sciences, 2018
In this paper the norm and the logarithmic norm of infinite matrices in the l_σ space are studied. Various estimates of these quantities are obtained.
openaire   +1 more source

Logarithmic norms and regular perturbations of differential equations

open access: yesAnnales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica, 2020
In this note we explore the concept of the logarithmic norm of a matrix and illustrate its applicability by using it to find conditions under which the convergence of solutions of regularly perturbed systems of ordinary differential equations is uniform globally in time.
openaire   +4 more sources

A Numerical–Experimental Approach for Multi‐Matrix Fiber‐Reinforced Plastics Characterization Using Finite Element Model Updating

open access: yesAdvanced Engineering Materials, EarlyView.
A numerical–experimental framework is developed for characterizing multi‐matrix fiber‐reinforced polymers (MM‐FRPs) combining epoxy and polyurethane matrices. Harmonic bending tests are integrated with finite element model updating (FEMU) to simultaneously identify elastic and viscoelastic material parameters.
Rodrigo M. Dartora   +4 more
wiley   +1 more source

On One Approach to Obtaining Estimates of the Rate of Convergence to the Limiting Regime of Markov Chains

open access: yesMathematics
We revisit the problem of the computation of the limiting characteristics of (in)homogeneous continuous-time Markov chains with the finite state space. In general, it can be performed only numerically.
Yacov Satin   +3 more
doaj   +1 more source

Weighted differentiation composition operators from the logarithmic Bloch space to the weighted-type space

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016
The boundedness of the weighted differentiation composition opera- tor from the logarithmic Bloch space to the weighted-type space is characterized in terms of the sequence (zn)n∈N0.
Li Songxiao, Stević Stevo
doaj   +1 more source

Al–Cu Composite Casting of Laser‐Deoxidized Copper: Bonding, Interfacial Chemistry, and Thermal Conductivity

open access: yesAdvanced Engineering Materials, EarlyView.
This study investigates laser‐based oxide removal of Cu inserts in oxygen‐free conditions and examines long‐term oxidation kinetics and surface chemistry under different atmospheres via X‐ray photoelectron spectroscopy. Al–Cu compound casting with differently oxidized surfaces is performed, and intermetallic phase formation, morphology, and thermal ...
Timon Steinhoff   +9 more
wiley   +1 more source

Dielectric Barrier Discharge Plasma Deoxidation of Natively Oxide Layer of Copper Powders in a Fluidized Bed

open access: yesAdvanced Engineering Materials, EarlyView.
This paper presents a novel approach to reducing oxide layers on metal powders using low‐temperature hydrogen dielectric barrier discharge plasmas at atmospheric pressure. Unlike conventional hydrogen‐plasma reductions, the powders do not contact the plasma directly.
Shukang Zhang   +3 more
wiley   +1 more source

Atom-Refined Multiway Greedy Algorithm for Tensor-Based Compressive Sensing

open access: yesIEEE Access, 2019
In this paper, we develop a novel multiway greedy algorithm, named atom-refined multiway orthogonal matching pursuit, for tensor-based compressive sensing (TCS) reconstruction.
Rongqiang Zhao   +3 more
doaj   +1 more source

Algorithmic linear dimension reduction in the l_1 norm for sparse vectors [PDF]

open access: yes, 2006
This paper develops a new method for recovering m-sparse signals that is simultaneously uniform and quick. We present a reconstruction algorithm whose run time, O(m log^2(m) log^2(d)), is sublinear in the length d of the signal.
Gilbert, A. C.   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy