پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 11 |
| تعداد شماره‌ها | 216 |
| تعداد مقالات | 2,169 |
| تعداد مشاهده مقاله | 3,047,323 |
| تعداد دریافت فایل اصل مقاله | 2,219,448 |
Constructing pentadiagonal matrices by partial eigen information | ||
| Journal of Discrete Mathematics and Its Applications | ||
| مقاله 4، دوره 10، شماره 1، خرداد 2025، صفحه 43-59 اصل مقاله (316.67 K) | ||
| نوع مقاله: Full Length Article | ||
| شناسه دیجیتال (DOI): 10.22061/jdma.2024.11385.1105 | ||
| نویسندگان | ||
| Mohammad Heydari* 1؛ Ferya Fathi2 | ||
| 1Department of Computer Science, Khansar Campus, University of Isfahan, Iran. | ||
| 2Department of Mathematics, Dezful Branch, Islamic Azad University, Dezful, Iran | ||
| تاریخ دریافت: 02 آبان 1403، تاریخ بازنگری: 01 آذر 1403، تاریخ پذیرش: 24 آذر 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. | ||
| کلیدواژه‌ها | ||
| Pentadiagonal Matrix؛ Eigenvalue؛ Eigenvector | ||
|
آمار تعداد مشاهده مقاله: 68 تعداد دریافت فایل اصل مقاله: 57 |
||