Vote for your favorite mineral in #MinCup25! - Taenite vs. Nontronite
It's a mineral found mostly in the farthest reaches of space vs one so common an exhaustive list of localities is nigh impossible as alloy #taenite faces off against clay #nontronite.
Log InRegister
Quick Links : The Mindat ManualThe Rock H. Currier Digital LibraryMindat Newsletter [Free Download]
Home PageAbout MindatThe Mindat ManualHistory of MindatCopyright StatusWho We AreContact UsAdvertise on Mindat
Donate to MindatCorporate SponsorshipSponsor a PageSponsored PagesMindat AdvertisersAdvertise on Mindat
Learning CenterWhat is a mineral?The most common minerals on earthInformation for EducatorsMindat ArticlesThe ElementsThe Rock H. Currier Digital LibraryGeologic Time
Minerals by PropertiesMinerals by ChemistryAdvanced Locality SearchRandom MineralRandom LocalitySearch by minIDLocalities Near MeSearch ArticlesSearch GlossaryMore Search Options
Search For:
Mineral Name:
Locality Name:
Keyword(s):
 
The Mindat ManualAdd a New PhotoRate PhotosLocality Edit ReportCoordinate Completion ReportAdd Glossary Item
Mining CompaniesStatisticsUsersMineral MuseumsClubs & OrganizationsMineral Shows & EventsThe Mindat DirectoryDevice SettingsThe Mineral Quiz
Photo SearchPhoto GalleriesSearch by ColorNew Photos TodayNew Photos YesterdayMembers' Photo GalleriesPast Photo of the Day GalleryPhotography

Brady, Martin L. (1998) A Fast Discrete Approximation Algorithm for the Radon Transform. SIAM Journal on Computing, 27 (1). 107-119 doi:10.1137/s0097539793256673

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleA Fast Discrete Approximation Algorithm for the Radon Transform
JournalSIAM Journal on Computing
AuthorsBrady, Martin L.Author
Year1998 (February)Volume27
Issue1
PublisherSociety for Industrial & Applied Mathematics (SIAM)
DOIdoi:10.1137/s0097539793256673Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID11240140Long-form Identifiermindat:1:5:11240140:9
GUID0
Full ReferenceBrady, Martin L. (1998) A Fast Discrete Approximation Algorithm for the Radon Transform. SIAM Journal on Computing, 27 (1). 107-119 doi:10.1137/s0097539793256673
Plain TextBrady, Martin L. (1998) A Fast Discrete Approximation Algorithm for the Radon Transform. SIAM Journal on Computing, 27 (1). 107-119 doi:10.1137/s0097539793256673
In(1998, February) SIAM Journal on Computing Vol. 27 (1) Society for Industrial & Applied Mathematics (SIAM)

See Also

These are possibly similar items as determined by title/reference text matching only.

Averbuch, A., Coifman, R. R., Donoho, D. L., Israeli, M., Shkolnisky, Y., Sedelnikov, I. (2008) A Framework for Discrete Integral Transformations II—The 2D Discrete Radon Transform. SIAM Journal on Scientific Computing, 30. 785-803 doi:10.1137/060650301
Schatzman, James C. (1996) Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform. SIAM Journal on Scientific Computing, 17. 1150-1166 doi:10.1137/s1064827593247023
Keiner, Jens, Vollrath, Antje (2012) A New Algorithm for the Nonequispaced Fast Fourier Transform on the Rotation Group. SIAM Journal on Scientific Computing, 34. doi:10.1137/110835232
Wang, Yanwei, Orchard, Jeff (2009) Fast Discrete Orthonormal Stockwell Transform. SIAM Journal on Scientific Computing, 31. 4000-4012 doi:10.1137/080737113
Parker, D. Stott (1998) Erratum: Conditions for Optimality of the Huffman Algorithm. SIAM Journal on Computing, 27 (1). 317 doi:10.1137/s0097539797328550
Ruiz-Antolín, Diego, Townsend, Alex (2018) A Nonuniform Fast Fourier Transform Based on Low Rank Approximation. SIAM Journal on Scientific Computing, 40. doi:10.1137/17m1134822
Elliott, William D., Board, Jr., John A. (1996) Fast Fourier Transform Accelerated Fast Multipole Algorithm. SIAM Journal on Scientific Computing, 17. 398-415 doi:10.1137/s1064827594264259
Dowling, Michael L. (1990) A Fast Parallel Horner Algorithm. SIAM Journal on Computing, 19 (1). 133-142 doi:10.1137/0219008
Aumann, Yonatan, Rabani, Yuval (1998) An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm. SIAM Journal on Computing, 27 (1). 291-301 doi:10.1137/s0097539794285983
Duke, Richard A., Lefmann, Hanno, Rödl, Vojtch (1995) A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given Graph. SIAM Journal on Computing, 24 (3). 598-620 doi:10.1137/s0097539793247634
Banks, Stephen C., Taylor, Howard L. (1980) A Modification to the Discrete $l_1 $ Linear Approximation Algorithm of Barrodale and Roberts. SIAM Journal on Scientific and Statistical Computing, 1 (2) 187-190 doi:10.1137/0901011
 
and/or  
Mindat.org is an outreach project of the Hudson Institute of Mineralogy, a 501(c)(3) not-for-profit organization.
Copyright © mindat.org and the Hudson Institute of Mineralogy 1993-2025, except where stated. Most political location boundaries are © OpenStreetMap contributors. Mindat.org relies on the contributions of thousands of members and supporters. Founded in 2000 by Jolyon Ralph.
To cite: Ralph, J., Von Bargen, D., Martynov, P., Zhang, J., Que, X., Prabhu, A., Morrison, S. M., Li, W., Chen, W., & Ma, X. (2025). Mindat.org: The open access mineralogy database to accelerate data-intensive geoscience research. American Mineralogist, 110(6), 833–844. doi:10.2138/am-2024-9486.
Privacy Policy - Terms & Conditions - Contact Us / DMCA issues - Report a bug/vulnerability Current server date and time: September 15, 2025 02:37:18
Go to top of page