Skip to content
Descubridor Institucional UMAR
Inicio
Búsqueda avanzada
Explorar
Inicio
Búsqueda avanzada
Explorar
Login
Language
English
Deutsch
Español
Français
Italiano
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Refined Error Bounds for Relaxed Greedy Randomized Kaczmarz Methods
Refined Error Bounds for Relaxed Greedy Randomized Kaczmarz Methods
Fuente:
Wiley Open Access
Saved in:
Bibliographic Details
Main Author:
Zhong‐Zhi Bai
Format:
Artículo Open Access
Published:
Wiley
2025
Subjects:
Numerical Linear Algebra with Applications
Online Access:
Acceder al recurso
Tags:
Add Tag
No Tags, Be the first to tag this record!
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Holdings
Description
Comments
Similar Items
Staff View
Be the first to leave a comment!
Your Comment
You must be logged in first
Similar Items
Admissibly Randomized Coordinate Descent Methods for Computing Extreme Eigenpairs of Symmetric Matrices
by: Zhong‐Zhi Bai, et al.
Published: (2025)
A Semi‐Randomized and Augmented Kaczmarz Method With Simple Random Sampling for Large‐Scale Inconsistent Linear Systems
by: Shunchang Li, et al.
Published: (2024)
A sampling greedy average regularized Kaczmarz method for tensor recovery
by: Xiaoqing Zhang, et al.
Published: (2024)
Modified Greedy Quasi Block Coordinate Descent Method for Solving Linear Least‐Squares Problems
by: Fatemeh P. A. Beik, et al.
Published: (2026)
An Inertial‐Relaxed Newton‐Type Projection Method for Solving Nonlinear Equations With Applications
by: Jianghua Yin, et al.
Published: (2026)
