Pith. sign in

REVIEW

Structured Condition Numbers of Structured Tikhonov Regularization Problem and their Estimations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1601.02333 v1 pith:QO7WTRU4 submitted 2016-01-11 math.NA cs.NA

classification math.NAcs.NA
keywords structuredconditionnumbersestimationregularizationtikhonovalgorithmsperturbation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Both structured componentwise and structured normwise perturbation analysis of the Tikhonov regularization are presented. The structured matrices under consideration include: Toeplitz, Hankel, Vandermonde, and Cauchy matrices. Structured normwise, mixed and componentwise condition numbers for the Tikhonov regularization are introduced and their explicit expressions are derived. For the general linear structure, we prove the structured condition numbers are smaller than their corresponding unstructured counterparts based on the derived expressions. By means of the power method and small sample condition estimation, the fast condition estimation algorithms are proposed. Our estimation methods can be integrated into Tikhonov regularization algorithms that use the generalized singular value decomposition (GSVD). The structured condition numbers and perturbation bounds are tested on some numerical examples and compared with their unstructured counterparts. Our numerical examples demonstrate that the structured mixed condition numbers give sharper perturbation bounds than existing ones, and the proposed condition estimation algorithms are reliable.

Discussion (0). Sign in to comment.

Pith tools