A unified treatment of tractability for approximation problems defined on Hilbert spaces
Journal of Complexity, ISSN: 0885-064X, Vol: 84, Page: 101856
2024
- 1Citations
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Metrics Details
- Citations1
- Citation Indexes1
- CrossRef1
Article Description
A large literature specifies conditions under which the information complexity for a sequence of numerical problems defined for dimensions 1,2,… grows at a moderate rate, i.e., the sequence of problems is tractable. Here, we focus on the situation where the space of available information consists of all linear functionals, and the problems are defined as linear operator mappings between Hilbert spaces. We unify the proofs of known tractability results and generalize a number of existing results. These generalizations are expressed as five theorems that provide equivalent conditions for (strong) tractability in terms of sums of functions of the singular values of the solution operators.
Bibliographic Details
http://www.sciencedirect.com/science/article/pii/S0885064X24000335; http://dx.doi.org/10.1016/j.jco.2024.101856; http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=85191658373&origin=inward; https://linkinghub.elsevier.com/retrieve/pii/S0885064X24000335; https://dx.doi.org/10.1016/j.jco.2024.101856
Elsevier BV
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know