Constructing pentadiagonal matrices by partial eigen information
سال انتشار: 1404
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 66
فایل این مقاله در 17 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JDMA-10-1_004
تاریخ نمایه سازی: 25 اسفند 1403
چکیده مقاله:
The inverse eigenvalue problem involves constructing a matrix based on its spectral information, along with providing conditions on the input data to determine the solvability of the problem. In this paper, we focus on a specific instance of the inverse eigenvalue problem, known as IEPSP, to generate symmetric pentadiagonal matrices using two pairs of eigenvalues from the desired matrix and an additional eigenvalue from each of its leading principal submatrices. Additionally, we explore a non-negative formulation of the inverse eigenvalue problem to produce a matrix that has non-negative elements. We present sufficient conditions for problem solvability, propose an algorithm, and provide several numerical examples to validate the results.
کلیدواژه ها:
نویسندگان
Mohammad Heydari
Department of Computer Science, Khansar Campus, University of Isfahan, Iran.
Ferya Fathi
Department of Mathematics, Dezful Branch, Islamic Azad University, Dezful, Iran