A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy

被引：26

作者：

Herman, Gabor T. ^{[1
]}

Chen, Wei ^{[1
]}

机构：

[1] CUNY, Grad Ctr, Dept Comp Sci, New York, NY 10016 USA

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 2008年 / 428卷 / 5-6期

关键词：

intensity-modulated radiation therapy; linear feasibility problem; algebraic reconstruction techniques;

D O I：

10.1016/j.laa.2006.11.009

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The goal of intensity-modulated radiation therapy (IMRT) is to deliver sufficient doses to tumors to kill them, but without causing irreparable damage to critical organs. This requirement can be formulated as a linear feasibility problem. The sequential (i.e., iteratively treating the constraints one after another in a cyclic fashion) algorithm ART3 is known to find a solution to such problems in a finite number of steps, provided that the feasible region is full dimensional. We present a faster algorithm called ART3+. The idea of ART3+ is to avoid unnecessary checks on constraints that are likely to be satisfied. The superior performance of the new algorithm is demonstrated by mathematical experiments inspired by the IMRT application. (C) 2006 Elsevier Inc. All rights reserved.

引用

页码：1207 / 1217

页数：11