Mixed settings for linear problems

G. W. Wasilkowski; H. Woźniakowski

doi:10.1016/0885-064X(89)90020-4

Mixed settings for linear problems

G. W. Wasilkowski
, H. Woźniakowski

Computer Science

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

We study the complexity of linear problems in mixed settings. We prove that the complexity of a mixed setting depends primarily on how the algorithm error is defined. That is, the worst error-average cost and worst error-worst cost complexities are essentially the same, as are the average error-worst cost and average error-average cost complexities.

Original language	English
Pages (from-to)	457-465
Number of pages	9
Journal	Journal of Complexity
Volume	5
Issue number	4
DOIs	https://doi.org/10.1016/0885-064X(89)90020-4
State	Published - Dec 1989

Bibliographical note

Funding Information:
* Research partially supported by the National Science Foundation under Grant CCR-86 03674. t Research partially supported by the National Science Foundation under Grant ICT-85-17289.

Funding

* Research partially supported by the National Science Foundation under Grant CCR-86 03674. t Research partially supported by the National Science Foundation under Grant ICT-85-17289.

Funders	Funder number
National Science Foundation Arctic Social Science Program	ICT-85-17289, CCR-86 03674, 8517289

ASJC Scopus subject areas

Algebra and Number Theory
Statistics and Probability
Numerical Analysis
General Mathematics
Control and Optimization
Applied Mathematics

Access to Document

10.1016/0885-064X(89)90020-4

Cite this

@article{273cd52fa4dc411b924362c3e8c74fd3,

title = "Mixed settings for linear problems",

abstract = "We study the complexity of linear problems in mixed settings. We prove that the complexity of a mixed setting depends primarily on how the algorithm error is defined. That is, the worst error-average cost and worst error-worst cost complexities are essentially the same, as are the average error-worst cost and average error-average cost complexities.",

author = "Wasilkowski, \{G. W.\} and H. Wo{\'z}niakowski",

note = "Funding Information: * Research partially supported by the National Science Foundation under Grant CCR-86 03674. t Research partially supported by the National Science Foundation under Grant ICT-85-17289.",

year = "1989",

month = dec,

doi = "10.1016/0885-064X(89)90020-4",

language = "English",

volume = "5",

pages = "457--465",

number = "4",

}

TY - JOUR

T1 - Mixed settings for linear problems

AU - Wasilkowski, G. W.

AU - Woźniakowski, H.

N1 - Funding Information: * Research partially supported by the National Science Foundation under Grant CCR-86 03674. t Research partially supported by the National Science Foundation under Grant ICT-85-17289.

PY - 1989/12

Y1 - 1989/12

N2 - We study the complexity of linear problems in mixed settings. We prove that the complexity of a mixed setting depends primarily on how the algorithm error is defined. That is, the worst error-average cost and worst error-worst cost complexities are essentially the same, as are the average error-worst cost and average error-average cost complexities.

AB - We study the complexity of linear problems in mixed settings. We prove that the complexity of a mixed setting depends primarily on how the algorithm error is defined. That is, the worst error-average cost and worst error-worst cost complexities are essentially the same, as are the average error-worst cost and average error-average cost complexities.

UR - https://www.scopus.com/pages/publications/38249024646

UR - https://www.scopus.com/pages/publications/38249024646#tab=citedBy

U2 - 10.1016/0885-064X(89)90020-4

DO - 10.1016/0885-064X(89)90020-4

M3 - Article

AN - SCOPUS:38249024646

SN - 0885-064X

VL - 5

SP - 457

EP - 465

JO - Journal of Complexity

JF - Journal of Complexity

IS - 4

ER -

Mixed settings for linear problems

Abstract

Bibliographical note

Funding

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this