使害怕
发表于 2025-3-26 22:31:48
Chain Statistics of Amorphous PolymersClassical complexity theory deals primarily with combinatorial (discrete, integer) problems. We extend the theory here to consider a wider class of problems.
oracle
发表于 2025-3-27 02:54:41
Patrice E. A. Turchi,Antonios GonisThe condition number of an invertible real or complex . x . matrix A is defined as.where ‖A‖ is the operator norm.and ℝ. or ℂ. is given the usual inner product. The condition number measures the relative error in the solution of the system of linear equations
obligation
发表于 2025-3-27 06:11:05
http://reply.papertrans.cn/24/2317/231668/231668_33.png
无礼回复
发表于 2025-3-27 10:56:25
https://doi.org/10.1007/978-3-642-82135-6The focus of this chapter is on the result that the complexity of a continuation algorithm can be bounded essentially by the square of the condition number of the homotopy.
EPT
发表于 2025-3-27 16:17:28
http://reply.papertrans.cn/24/2317/231668/231668_35.png
含水层
发表于 2025-3-27 18:23:45
Definitions and First Properties of ComputationWe begin the development of our theory of computation with the definition of a . over a ring. Although it is necessary to define a . to be a more general object in order to fully develop a uniform theory —in particular with regard to complexity issues— a great deal can already be gleaned from the finite-dimensional case.
admission
发表于 2025-3-28 00:22:01
Decision Problems and Complexity over a RingClassical complexity theory deals primarily with combinatorial (discrete, integer) problems. We extend the theory here to consider a wider class of problems.
ARBOR
发表于 2025-3-28 02:13:47
Condition Numbers and the Loss of Precision of Linear EquationsThe condition number of an invertible real or complex . x . matrix A is defined as.where ‖A‖ is the operator norm.and ℝ. or ℂ. is given the usual inner product. The condition number measures the relative error in the solution of the system of linear equations
声音刺耳
发表于 2025-3-28 07:26:39
The Condition Number in ℙ(,,)In this chapter we study the condition numbers μ(.) and μ.(.) as functions on ℙ(..) in greater depth. Our main theorem is proven in Section 13.6.
Cougar
发表于 2025-3-28 10:33:28
Complexity and the Condition NumberThe focus of this chapter is on the result that the complexity of a continuation algorithm can be bounded essentially by the square of the condition number of the homotopy.