| dc.contributor | 應數系 | |
| dc.creator (作者) | 蔡炎龍 | |
| dc.creator (作者) | Lin, Tse-Yu;Tsai, Yen-Lung | |
| dc.date (日期) | 2025-01 | |
| dc.date.accessioned | 11-Feb-2026 09:10:47 (UTC+8) | - |
| dc.date.available | 11-Feb-2026 09:10:47 (UTC+8) | - |
| dc.date.issued (上傳時間) | 11-Feb-2026 09:10:47 (UTC+8) | - |
| dc.identifier.uri (URI) | https://ah.lib.nccu.edu.tw/item?item_id=181224 | - |
| dc.description.abstract (摘要) | In this paper, we investigate the iterative solution of a sequence of graph Laplacian systems by leveraging the (relative) continuity of the generalized inverse operator. Our primary objective is to extend traditional matrix perturbation techniques specifically to the context of graph Laplacian systems. We achieve this by modeling the evolution of these systems starting from a given initial graph Laplacian and applying a series of systematic updates. We propose a novel framework that formulates an iterative method for solving the targeted graph Laplacian system based on the solutions of simpler, earlier Laplacian systems. By establishing a relationship between the solutions of two Laplacian systems, we derive a recursive formula that enables efficient computation of the updated solutions. This approach not only enhances computational efficiency but also maintains accuracy, as it utilizes the inherent structure of the graph Laplacian, including its positive semi-definiteness and the zero-mean condition of the right-hand side. | |
| dc.format.extent | 111 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | 2025 IEEE International Conference on Consumer Electronics (ICCE)}, IEEE, pp.1-3 | |
| dc.title (題名) | A Sequential Perturbation Framework for Solving Laplacian Systems | |
| dc.type (資料類型) | conference | |
| dc.identifier.doi (DOI) | 10.1109/ICCE63647.2025.10930097 | |
| dc.doi.uri (DOI) | https://doi.org/10.1109/ICCE63647.2025.10930097 | |
