Abstract
Improvements in complex-conjugate gradient algorithms applied to the discrete-dipole
approximation are reported. It is shown that computational time is reduced
by use of the stabilized version of the biconjugate gratings algorithm, with
diagonal left preconditioning.
© 1997 Optical Society of America
Full Article |
PDF Article
More Like This
References
You do not have subscription access to this journal. Citation lists with outbound citation links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access OSA Member Subscription
Cited By
You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access OSA Member Subscription
Tables (2)
You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access OSA Member Subscription
Metrics
You do not have subscription access to this journal. Article level metrics are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access OSA Member Subscription