نتایج جستجو برای: bidiagonalization procedure
تعداد نتایج: 616072 فیلتر نتایج به سال:
rawls’ theory of justice is expressed in a constructivist procedure. he holds that his constructivist procedure is free of metaphysical presuppositions. his constructivist procedure is here pursued in three stages: (1) in a theory of justice, rawls intends to come to moral principles regarding the original position which could even result in other moral principles as well. he also asserts some ...
a 46 year old man had been undergone aortic valve replacement (avr) due to mechanical aortic valve endocarditis two month ago. he was referred to imam khomeini hospital because of dyspnea since two weeks ago. echocardiography showed the false aneurysm, with an area of flow beyond the lumen of the aorta. this patient underwent reoperation, the previously implanted aortic valve was removed, metic...
We describe the development of a method for the efficient computation of the smallest singular values and corresponding vectors for large sparse matrices [4]. The method combines state-of-the-art techniques that make it a useful computational tool appropriate for large scale computations. The method relies upon Lanczos bidiagonalization (LBD) with partial reorthogonalization [6], enhanced with ...
A concept of "Fractal Fracture Mechanics" for HDR .(Hot Dry Rock) geothermal reservoir design has been developed as an extension of conventional rock fracture mechanics. It is suggested that this concept is successfully applicable to characterize and model subsurface fracture network in HDR geothermal reservoir. Furthermore, this modeling procedure makes it possible to evaluate the thermal ener...
0
by studying the evolution history of budgeting systems, you may discern three stages: in the first stage, controlling role of budget is regarded its major function. in the second stage, budget is considered as a means for management improvement. in the third stage, the role of budget is considered in economic planning, implementation of programs and government performance management. after worl...
This paper is the result of contrived efforts to break the barrier between numerical accuracy and run time efficiency in computing the fundamental decomposition of numerical linear algebra – the singular value decomposition (SVD) of a general dense matrix. It is an unfortunate fact that the numerically most accurate one–sided Jacobi SVD algorithm is several times slower than generally less accu...
The computation of a few singular triplets of large, sparse matrices is a challenging task, especially when the smallest magnitude singular values are needed in high accuracy. Most recent efforts try to address this problem through variations of the Lanczos bidiagonalization method, but they are still challenged even for medium matrix sizes due to the difficulty of the problem. We propose a nov...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید