Relevant bibliographies by topics / FORTRAN (Computer programming language)

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'FORTRAN (Computer programming language)'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'FORTRAN (Computer programming language).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "FORTRAN (Computer programming language)"

1

Nofre, David. "The Politics of Early Programming Languages." Historical Studies in the Natural Sciences 51, no. 3 (June 1, 2021): 379–413. http://dx.doi.org/10.1525/hsns.2021.51.3.379.

Full text
Abstract:
There probably has never been such a controversial programming language as Algol. In the early 1960s the disciplinary success of the so-called Algol project in helping to forge the discipline of computer science was not matched by a significant adoption of the Algol language, in any of its three versions. This contrast is even more striking when considering the contemporary success of IBM’s Fortran, a language that, like Algol, was also conceived for scientific computation, but unlike Algol, initially only available for IBM computers. Through extensive archival research, this article shows how the relentless pursuit of a still better language that came to dominate the agenda of the Algol project brought to the fore the tension between the research-driven dimension of the project and the goal of developing a reliable programming language. Such a strong research-oriented agenda increased IBM’s doubts about a project that the firm already felt little urge to support. Yet IBM did not want to appear as obstructing the development of either Algol or Cobol, even if these “common languages” posed a clear risk to the firm’s marketing model. The US Department of Defense’s endorsement of Cobol and the rising popularity of Algol in Europe convinced IBM to push for the use of Fortran in Western Europe in order to protect the domestic market. IBM’s action in support of Fortran reminds us of the power imbalances that have shaped computer science.
APA, Harvard, Vancouver, ISO, and other styles
2

Cheng, H. H. "Extending C and FORTRAN for Design Automation." Journal of Mechanical Design 117, no. 3 (September 1, 1995): 390–95. http://dx.doi.org/10.1115/1.2826691.

Full text
Abstract:
The CH programming language is designed to be a superset of C. CH bridges the gap between C and FORTRAN; it encompasses all the programming capabilities of FORTRAN 77 and consists of features of many other programming languages and software packages. Unlike other general-purpose programming languages, CH is designed to be especially suitable for applications in mechanical systems engineering. Because of our research interests, many programming features in CH have been implemented for design automation, although they are useful in other applications as well. In this paper we will describe these new programming features for design automation, as they are currently implemented in CH in comparison with C and FORTRAN 77.
APA, Harvard, Vancouver, ISO, and other styles
3

Foster, I. T., and K. M. Chandy. "FORTRAN M - A Language for Modular Parallel Programming." Journal of Parallel and Distributed Computing 26, no. 1 (April 1995): 24–35. http://dx.doi.org/10.1006/jpdc.1995.1044.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Raman, K. V. "Some Features of Java Language Illustrated through Examples from Chemistry." Mapana - Journal of Sciences 1, no. 2 (July 3, 2003): 22–56. http://dx.doi.org/10.12723/mjs.2.5.

Full text
Abstract:
Computer programming has been used effectively by theoretical chemists and organic chemists to solve various types of problem in chemistry. Initially the languages used for computations in chemistry were FORTRAN and BASIC. Later the Pascal language was used for solving problems in chemistry and physics. Recently the languages C and C++ and Java have been used to solve problems in chemistry. In this paper I will illustrate features of C, C++ choosing examples from chemistry. Computer programming has been used effectively by theoretical chemists and organic chemists to solve various types of problem in chemistry. Initially the languages used for computations in chemistry were FORTRAN and BASIC. Later the Pascal language was used for solving problems in chemistry and physics. Recently the languages C and C++ and Java have been used to solve problems in chemistry. In this paper I will illustrate features of C, C++ choosing examples from chemistry. Some examples presented in this these languages are Program to calculate reduced mass of homo diatomic or hetero diatomic Program to calculate the molecular weight of a tetra atomic system ABCD Program to calculate NMR frequencies of spin 1/2 nuclei only Program to calculate NMR and ESR frequencies The examples presented in Java 2 are Program to calculate unit cell dimension of a crystal Program to generate the chair form and boat form of cyclohexane. The examples presented in this monograph will help researchers in theoretical chemistry and organic chemistry to develop their own software.
APA, Harvard, Vancouver, ISO, and other styles
5

Schreiber, Robert. "High Performance Fortran, Version 2." Parallel Processing Letters 07, no. 04 (December 1997): 437–49. http://dx.doi.org/10.1142/s0129626497000425.

Full text
Abstract:
This paper introduces the ideas that underly the data-parallel language High Performance Fortran (HPF) and the new ideas in version 2 of HPF. It first reviews HPF's key language elements. It discusses the meaning of data parallelism and the limitations of HPF version 1 as a data-parallel programming language. The second part of the paper is a review of the development of version 2 of HPF. The extended language, under development in 1996, includes a richer data mapping capability; an extension to the independent loop that allows reduction operations in the loop range; a means for directing the mapping of computation as well as data; and a way to specify concurrent execution of several parallel tasks on disjoint subsets of processors.
APA, Harvard, Vancouver, ISO, and other styles
6

Reina, Reina, and Josef Bernadi Gautama. "Perbandingan Bubble Sort dengan Insertion Sort pada Bahasa Pemrograman C dan Fortran." ComTech: Computer, Mathematics and Engineering Applications 4, no. 2 (December 1, 2013): 1106. http://dx.doi.org/10.21512/comtech.v4i2.2553.

Full text
Abstract:
Sorting is a basic algorithm studied by students of computer science major. Sorting algorithm is the basis of other algorithms such as searching algorithm, pattern matching algorithm. Bubble sort is a popular basic sorting algorithm due to its easiness to be implemented. Besides bubble sort, there is insertion sort. It is lesspopular than bubble sort because it has more difficult algorithm. This paper discusses about process time between insertion sort and bubble sort with two kinds of data. First is randomized data, and the second is data of descending list. Comparison of process time has been done in two kinds of programming language that is C programming language and FORTRAN programming language. The result shows that bubble sort needs more time than insertion sort does.
APA, Harvard, Vancouver, ISO, and other styles
7

Brush, Denise. "Should I throw out these old COBOL books?" Library Hi Tech News 31, no. 8 (September 30, 2014): 15–18. http://dx.doi.org/10.1108/lhtn-07-2014-0060.

Full text
Abstract:
Purpose – The purpose of this paper is to provide guidance to librarians about whether to keep or withdraw books on pre-Internet computer programming languages. Design/methodology/approach – For each of the programming languages considered, this article provides historical background and an assessment of current academic library collection needs. Findings – Many older languages (COBOL, FORTRAN, C, Lisp, Prolog, and Ada) are still in use and need reliable sources available for reference. Additionally, books about obsolete languages have educational value due to their influence on the development on newer languages such as C++ and Java. Practical applications – This information will be useful to academic librarians who want to make the best choices about keeping or withdrawing computer programming books. Originality/value – Most librarians responsible for managing computer science collections do not have a computer programming background, so they do not know which older languages are still important.
APA, Harvard, Vancouver, ISO, and other styles
8

Galassi, Giuseppe, and Richard V. Mattessich. "Some Clarification to the Evolution of the Electronic Spreadsheet." Journal of Emerging Technologies in Accounting 11, no. 1 (December 1, 2014): 99–104. http://dx.doi.org/10.2308/jeta-51114.

Full text
Abstract:
ABSTRACT As early as 1961 Mattessich suggested (in an article in The Accounting Review) to use budget simulation in form of a computerized spreadsheet. This was followed up by him in a mathematical model, outlined in his book Accounting and Analytical Methods (Mattessich 1964a) with a corresponding computer program (in FORTRAN IV on mainframe computers), including illustrations in a companion volume (Simulation of the Firm through a Budget Computer Program, Mattessich 1964b). Five years later (in 1969) Rene Pardo and Remy Landau co-presented “LANPAR” (LANguage for Programming Arrays at Random) at Random Corporation. This electronic spreadsheet type was also used on mainframe computers for budgeting at Bell Canada, AT&T, Bell operating companies, and General Motors. In 1978, Dan Bricklin and Robert Frankston introduced VisiCalc, the first commercialized spreadsheet program for personal desktop (Apple) computers. This program became the trailblazer for future developments of electronic spreadsheets.
APA, Harvard, Vancouver, ISO, and other styles
9

Piekarska, W., M. Kubiak, Z. Saternus, and K. Rek. "Computer Modelling of Thermomechanical Phenomena in Pipes Welded using a Laser Beam." Archives of Metallurgy and Materials 58, no. 4 (December 1, 2013): 1237–42. http://dx.doi.org/10.2478/amm-2013-0156.

Full text
Abstract:
Abstract This study concerns numerical modelling and computer simulation of thermomechanical phenomena accompanying spiral welding of pipes made of stainless steel X5CrNi18-10 using a laser beam. Based on Abaqus FEA software, 3D numerical analysis was performed. Power distribution of spirally moving heat source was implemented into additional DFLUX subroutine, written in Fortran programming language. Thermomechanical properties of steel changing with temperature were taken into account in the analysis. The efficiency of material melting by different welding sources as well as the influence of heat load on the shape of melted zone, deformation of welded pipe and residual stress were examined.
APA, Harvard, Vancouver, ISO, and other styles
10

Mattson, Timothy G. "The Efficiency of Linda for General Purpose Scientific Programming." Scientific Programming 3, no. 1 (1994): 61–71. http://dx.doi.org/10.1155/1994/401086.

Full text
Abstract:
Linda (Linda is a registered trademark of Scientific Computing Associates, Inc.) is a programming language for coordinating the execution and interaction of processes. When combined with a language for computation (such as C or Fortran), the resulting hybrid language can be used to write portable programs for parallel and distributed multiple instruction multiple data (MIMD) computers. The Linda programming model is based on operations that read, write, and erase a virtual shared memory. It is easy to use, and lets the programmer code in a very expressive, uncoupled programming style. These benefits, however, are of little value unless Linda programs execute efficiently. The goal of this article is to demonstrate that Linda programs are efficient making Linda an effective general purpose tool for programming MIMD parallel computers. Two arguments for Linda's efficiency are given; the first is based on Linda's implementation and the second on a range of case studies spanning a complete set of parallel algorithm classes.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "FORTRAN (Computer programming language)"

1

Walker, Edward. "Extracting data flow information for parallelizing FORTRAN nested loop kernels." Thesis, University of York, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239812.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Santavicca, Jeffery W. "Fluid mechanics tutorials in GKS supported FORTRAN." Thesis, This resource online, 1992. http://scholar.lib.vt.edu/theses/available/etd-09122009-040300/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Öigaard, Sandra. "Programming language & Gender." Thesis, Linnéuniversitetet, Institutionen för datavetenskap (DV), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-45707.

Full text
Abstract:
Once women were the pioneers within the tech industry, but during the last decades the amount of women who choose a career within computer science has decreased rapidly. Programming languages have evolved during the last decades and because of the growing gender gap in the industry, they have done so involuntarily in the absence of women. The imbalance raises the question if the tech industry and the programming languages have been adapted for a more masculine way of developing software. A quantitative study and a literature review evaluates if there is a need for a computerlanguage developed towards women. The study comes to the conclusion that there is no need for a female inspired computer language, but the way computer languages are taught suits the male way of thinking better than the female way.
APA, Harvard, Vancouver, ISO, and other styles
4

Perez, Manuel A. "A language for interactive computer graphics programming." Virtual Press, 1987. http://liblink.bsu.edu/uhtbin/catkey/484784.

Full text
Abstract:
The writer defines graphics-oriented data types and operators as the basis for a graphics-oriented programming language. Most of these data types are not available in today's languages. They are usually defined as structures or records composed of some other basic types. These include points, rectangles, transformations, etc. Some operators, such as vector addition, are defined to work with them.The design and implementation of an interpreter to test some of these graphics data types and operators are discussed.The writer also examines some of the tools needed in a graphics programming environment.
APA, Harvard, Vancouver, ISO, and other styles
5

Pellerin, Clément. "Taskell : a concurrent constraint programming language." Thesis, McGill University, 1991. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=61089.

Full text
Abstract:
Taskell is an instance of the concurrent constraint programming framework cc. The framework is parameterized by a choice of constraint system. The constraint system of Taskell is the set of finite trees with equality. The choice of constraint system makes Taskell similar to concurrent logic programming languages. When computing with partial information the notion of reading and writing memory becomes incoherent. The framework replaces these operations by ask and tell respectively. We hope to understand this new paradigm by studying implementations of cc languages. Taskell is a parallel implementation of a cc language written in Concurrent ML.
APA, Harvard, Vancouver, ISO, and other styles
6

Kilaru, Jyothsna. "PLASA| Programming Language for Synchronous Agents." Thesis, California State University, Long Beach, 2019. http://pqdtopen.proquest.com/#viewpdf?dispub=10978428.

Full text
Abstract:

The introduction of autonomous agents to replace humans in unfavorable and unreachable environments has been a longstanding goal in the field of robotics. The existing work of various researchers address several challenges involved in design or control of such robotic systems. However, existing solutions have been unable to offer users an easy and efficient programming environment for developing versatile robotic applications. These inadequacies have given rise to the development of a new robot programming language, called Programming LAnguage for Synchronous Agents (PLASA).

The main objective of this paper is to give a brief introduction about the newly developed robot programming language, PLASA, which facilitates the rapid implementation of co-operative applications on multiple physical robots, in dynamic environments. The syntax and semantics of this language are similar to those in many other high-level programming languages. In addition to the features offered by other high-level languages, PLASA offers two novel instructions: "do instruction'', which helps in executing the main motion primitives, and "query instruction'', which helps in executing a great variety of geometric and mathematical queries. A compiler produces a program that is executed by a virtual machine in each of the robots. The virtual machine offers a key characteristic that guarantees the timely execution of robots' movements through a synchronization protocol. To verify the correct functionality of the co-operative applications, a simulator that includes the proposed components has been provided.

The developed language offers abstraction for hiding complex network details and delivers human-readable language; these features make the programming environment suitable for anyone to control robot systems, regardless of expertise. The synchronization and co-ordination mechanisms provided by the language ensure the safety and prompt execution of robot operations in a robot system developed using PLASA.

APA, Harvard, Vancouver, ISO, and other styles
7

Rose, Eli. "Arrow: A Modern Reversible Programming Language." Oberlin College Honors Theses / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1443226400.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Chabot, Éric. "Parallélisme et communications dans les applications scientifiques (fortran) /." Thèse, Chicoutimi : Université du Québec à Chicoutimi, 1993. http://theses.uqac.ca.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Svallfors, Hugo. "Sard: An Object-Functional Programming Language." Thesis, Umeå universitet, Institutionen för datavetenskap, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-51276.

Full text
Abstract:
This bachelor's degree concerns the specification of a new programming language. This language, called Sard, is a backwards-incompatible new version of the existing language Scala. Sard, like Scala, is a high-level object-functional language. Unlike Scala, it is not very closely tied to the JVM or Java, eliminating some constraints on the language's design. Since this necessitates breaking backwards compatibility with Scala, the opportunity to disregard it is used to x some of the author's irritations with the language. This degree mostly focuses on deciding on the exact changes to Scala, and on the overall design, rather than on implementing a compiler for the language. A reason for this is that the bachelor's degree provides insuficient time to properly implement´and debug a compiler. Another is the desirability of pushing changes to the language as early into the design process as possible. Preferably, almost all changes to the language should occur before any compiler code has been written. The design eventually produced gets rid of some known issues stemming from the JVM, like null pointers, non-reified generics and single inheritance. Several features of Scala, like self-type annotations and in x syntax for methods are scrapped. Others, like pattern matching, are generalized. Some changes to the syntax are also made, particularly in the areas of closures, pattern matching and object construction. As of yet, this language has no implementation, and in future work, this must be rectified. Sard also requires calling compatibility with another programming language, but this remains to be specified. Nevertheless, Sard constitutes a promising refinement of an already great programming language, and it is hoped that Sard will x the few remaining issues with Scala's design.
APA, Harvard, Vancouver, ISO, and other styles
10

Grattage, Jonathan James. "A functional quantum programming language." Thesis, University of Nottingham, 2006. http://eprints.nottingham.ac.uk/10250/.

Full text
Abstract:
This thesis introduces the language QML, a functional language for quantum computations on finite types. QML exhibits quantum data and control structures, and integrates reversible and irreversible quantum computations. The design of QML is guided by the categorical semantics: QML programs are interpreted by morphisms in the category FQC of finite quantum computations, which provides a constructive operational semantics of irreversible quantum computations, realisable as quantum circuits. The quantum circuit model is also given a formal categorical definition via the category FQC. QML integrates reversible and irreversible quantum computations in one language, using first order strict linear logic to make weakenings, which may lead to the collapse of the quantum wavefunction, explicit. Strict programs are free from measurement, and hence preserve superpositions and entanglement. A denotational semantics of QML programs is presented, which maps QML terms into superoperators, via the operational semantics, made precise by the category Q. Extensional equality for QML programs is also presented, via a mapping from FQC morphisms into the category Q.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "FORTRAN (Computer programming language)"

1

Evett, Jack B. Fortran programming. 2nd ed. San Jose, Calif: Engineering Press, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

R, Philips Ivor, and Lahey Thomas M, eds. Fortran 90 programming. Wokingham, England: Addison-Wesley, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Efficient FORTRAN programming. New York: Wiley, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Metcalf, Michael. The F programming language. Oxford: Oxford University Press, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

1938-, Reid John K., ed. The F programming language. Oxford: Oxford University Press, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Joyce, Calderbank Valerie, ed. Programming in FORTRAN. 3rd ed. London: Chapman and Hall, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Ribar, L. John. FORTRAN programming for Windows. Berkeley, Calif: Osborne McGraw-Hill, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Koffman, Elliot B. Fortran. 5th ed. Reading, Mass: Addison-Wesley, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

L, Friedman Frank, and Koffman Elliot B, eds. Fortran. 5th ed. Reading, Mass: Addison-Wesley Pub. Co, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Koffman, Elliot B. Fortran. 5th ed. Reading, Mass: Addison-Wesley Pub. Co., 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "FORTRAN (Computer programming language)"

1

Sakagami, Hitoshi. "Three-Dimensional Fluid Code with XcalableMP." In XcalableMP PGAS Programming Language, 165–79. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-7683-6_6.

Full text
Abstract:
AbstractIn order to adapt parallel computers to general convenient tools for computational scientists, a high-level and easy-to-use portable parallel programming paradigm is mandatory. XcalableMP, which is proposed by the XcalableMP Specification Working Group, is a directive-based language extension for Fortran and C to easily describe parallelization in programs for distributed memory parallel computers. The Omni XcalableMP compiler, which is provided as a reference XcalableMP compiler, is currently implemented as a source-to-source translator. It converts XcalableMP programs to standard MPI programs, which can be easily compiled by the native Fortran compiler and executed on most of parallel computers. A three-dimensional Eulerian fluid code written in Fortran is parallelized by XcalableMP using two different programming models with the ordinary domain decomposition method, and its performances are measured on the K computer. Programs converted by the Omni XcalableMP compiler prevent native Fortran compiler optimizations and show lower performance than that of hand-coded MPI programs. Finally almost the same performances are obtained by using specific compiler options of the native Fortran compiler in the case of a global-view programming model, but performance degradation is not improved by specifying any native compiler options when the code is parallelized by a local-view programming model.
APA, Harvard, Vancouver, ISO, and other styles
2

Murai, Hitoshi, Masahiro Nakao, and Mitsuhisa Sato. "XcalableMP Programming Model and Language." In XcalableMP PGAS Programming Language, 1–71. Singapore: Springer Singapore, 2020. http://dx.doi.org/10.1007/978-981-15-7683-6_1.

Full text
Abstract:
AbstractXcalableMP (XMP) is a directive-based language extension of Fortran and C for distributed-memory parallel computers, and can be classified as a partitioned global address space (PGAS) language. One of the remarkable characteristics of XMP is that it supports both global-view and local-view parallel programming. This chapter describes the programming model and language specification of XMP.
APA, Harvard, Vancouver, ISO, and other styles
3

Stauffer, Dietrich, Friedrich W. Hehl, Nobuyasu Ito, Volker Winkelmann, and John G. Zabolitzky. "Short Course in FORTRAN Programming Methodology." In Computer Simulation and Computer Algebra, 15–18. Berlin, Heidelberg: Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/978-3-642-78117-9_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Weik, Martin H. "programming language." In Computer Science and Communications Dictionary, 1351. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_14888.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Brooks, David R. "Solving Problems with a High-Level Programming Language." In Problem Solving with Fortran 90, 19–68. New York, NY: Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4612-1952-1_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ishikawa, Hiroshi. "Database Programming Language." In Computer Science Workbench, 19–42. Tokyo: Springer Japan, 1993. http://dx.doi.org/10.1007/978-4-431-68308-7_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kalinov, Alexey, Ilya Ledovskikh, Mikhail Posypkin, Zakhar Levchenko, and Vladimir Chizhov. "A Fortran Evolution of mpC Parallel Programming Language." In Parallel Processing and Applied Mathematics, 936–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11752578_113.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Weik, Martin H. "declarative programming language." In Computer Science and Communications Dictionary, 371. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_4527.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Weik, Martin H. "interactive programming language." In Computer Science and Communications Dictionary, 808. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_9289.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Weik, Martin H. "structured programming language." In Computer Science and Communications Dictionary, 1679. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_18425.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "FORTRAN (Computer programming language)"

1

Cheng, Harry H. "Extending C and FORTRAN for Design Automation." In ASME 1994 Design Technical Conferences collocated with the ASME 1994 International Computers in Engineering Conference and Exhibition and the ASME 1994 8th Annual Database Symposium. American Society of Mechanical Engineers, 1994. http://dx.doi.org/10.1115/detc1994-0051.

Full text
Abstract:
Abstract The CH programming language, a high-performance C, is designed to be a superset of ANSI C. CH bridges the gap between ANSI C and FORTRAN; it encompasses almost all the programming capabilities of FORTRAN 77 in the current implementation and consists of features of many other programming languages and software packages. Unlike other general-purpose programming languages, CH is designed to be especially suitable for applications in mechanical systems engineering. Because of our research interests, many programming features in CH have been implemented for design automation, although they are useful in other applications as well. In this paper we will describe these new programming features for design automation, as they are currently implemented in CH in comparison with ANSI C and FORTRAN 77.
APA, Harvard, Vancouver, ISO, and other styles
2

Thompson, Sean, and Harry H. Cheng. "Computer-Aided Displacement Analysis of Spatial Mechanisms." In ASME 1994 Design Technical Conferences collocated with the ASME 1994 International Computers in Engineering Conference and Exhibition and the ASME 1994 8th Annual Database Symposium. American Society of Mechanical Engineers, 1994. http://dx.doi.org/10.1115/detc1994-0052.

Full text
Abstract:
Abstract Recently, Cheng (1993) introduced the CH programming language. CH is designed to be a superset of ANSI C with all programming features of FORTRAN. Many programming features in CH are specifically designed and implemented for design automation. Handling dual number as a basic built-in data type in the language is one example. Formulas with dual numbers can be translated into CH programming statements as easily as formulas with real and complex numbers. In this paper we will show that both formulation and programming with dual numbers are remarkably simple for analysis of complicated spatial mechanisms within the programming paradigm of CH. With computational capabilities for dual formulas in mind, formulas for analysis of spatial mechanisms are derived differently from those intended for implementation in computer programming languages without dual data type. We will demonstrate some formulation and programming techniques in the programming paradigm of CH through a displacement analysis of the RCRCR five-link spatial mechanism. A CH program that can obtain both numerical and graphical results for complete displacement analysis of the RCRCR mechanism will be presented.
APA, Harvard, Vancouver, ISO, and other styles
3

Viola, Jairo, Sina Dehghan, and YangQuan Chen. "Embedded RIOTS: Model Predictive Control Towards Edge." In ASME 2019 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2019. http://dx.doi.org/10.1115/detc2019-97046.

Full text
Abstract:
Abstract RIOTS is a general purpose optimal problem solver written as a MATLAB toolbox with mixed-language programming (C, Fortran, Matlab, Simulink). This first paper introduces how to make RIOTS run under an embedded platform RP3B (Raspberry Pi 3 B) with Windows 10. We presented the system architecture and a complete demo on running RIOTS as the inner kernel for MPC, using a house made thermal control system based on Peltier modules.
APA, Harvard, Vancouver, ISO, and other styles
4

Pasch, Jim, Tom Conboy, Darryn Fleming, Matt Carlson, and Gary Rochau. "Steady State Supercritical Carbon Dioxide Recompression Closed Brayton Cycle Operating Point Comparison With Predictions." In ASME Turbo Expo 2014: Turbine Technical Conference and Exposition. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/gt2014-25777.

Full text
Abstract:
The U.S. Department of Energy Office of Nuclear Energy (DOE-NE) supercritical carbon dioxide recompression closed Brayton cycle (RCBC) test assembly (TA) construction has been completed to its original design and resides at Sandia National Laboratories, New Mexico. Commissioning tests were completed in July 2012, followed by a number of tests in both the recompression CBC configuration, and in a bottoming cycle configuration that is proprietary to a current customer. While the test assembly has been developed and installed to support testing, a computer model of the loop, written in Fortran programming language, has also been developed. The purpose of this iterative model is to facilitate data interpretation, guide test assembly design modifications, develop control schemes, and serve as a foundation from which to develop a transient model. Of central utility is its modular nature, which has already been leveraged to develop a customer’s bottoming cycle configuration. Verification that the model uses appropriate physical representations of components and processes, is performing as intended, and validation that the model accurately reproduces test data, are necessary activities. Completion of the model’s verification and validation (V&V) supports the long-term goal of commercializing the RCBC for a sodium fast reactor. This paper presents verification results of certain subprocesses of the iterative computer model. Verification of these subprocesses was completed with positive results. While an adequate range of data for complete and thorough validation do not yet exist, comparison of subprocess predictions with data from a single, representative operating point are presented as are explanations for differences. Recommendations for activities necessary to complete subprocess and model validation are given. The RCBC iterative computer model V&V process should be revisited following completion of these recommended actions and the generation of steady state data while operating near the test assembly design point.
APA, Harvard, Vancouver, ISO, and other styles
5

Klöckner, Andreas. "Loo.py: from fortran to performance via transformation and substitution rules." In PLDI '15: ACM SIGPLAN Conference on Programming Language Design and Implementation. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2774959.2774969.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Haque, Imtiaz, and Cecil O. Huey. "Declarative Rule Based Programming for Solving Problems in Kinematics and Dynamics of Machines." In ASME 1991 International Computers in Engineering Conference and Exposition. American Society of Mechanical Engineers, 1991. http://dx.doi.org/10.1115/cie1991-0140.

Full text
Abstract:
Abstract The required, senior course in kinematics and dynamics of mechanisms at Clemson University is currently being taught using a declarative rule based program as a computational tool for all analytical tasks. This is because of the necessity of numerical techniques for the solution of mechanism problems and the difficulty and inefficiency of programming in Fortran or similar languages. Also, it is felt that introductory course work in any subject should not be tied to specific purpose applications software. The course has been successful in developing sound competency in analysis and design of mechanisms while relying only on a widely available, general purpose computational tool. The overall approach used in the course is described and examples of the work assigned to students are provided.
APA, Harvard, Vancouver, ISO, and other styles
7

Loveman. "Fortran: a modern standard programming language for parallel scalable high performance technical computing." In Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing ICPPW-96. IEEE, 1996. http://dx.doi.org/10.1109/icppw.1996.538600.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Plaice, John, and Blanca Mancilla. "Cartesian Programming: The TransLucid Programming Language." In 2009 33rd Annual IEEE International Computer Software and Applications Conference. IEEE, 2009. http://dx.doi.org/10.1109/compsac.2009.139.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hu, Yuanming. "The Taichi programming language." In SIGGRAPH '20: Special Interest Group on Computer Graphics and Interactive Techniques Conference. New York, NY, USA: ACM, 2020. http://dx.doi.org/10.1145/3388769.3407493.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chou, Yu-Cheng, and Harry H. Cheng. "Interpretive MPI for Parallel Computing." In ASME 2008 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/detc2008-49996.

Full text
Abstract:
Message Passing Interface (MPI) is a standardized library specification designed for message-passing parallel programming on large-scale distributed systems. A number of MPI libraries have been implemented to allow users to develop portable programs using the scientific programming languages, Fortran, C and C++. Ch is an embeddable C/C++ interpreter that provides an interpretive environment for C/C++ based scripts and programs. Combining Ch with any MPI C/C++ library provides the functionality for rapid development of MPI C/C++ programs without compilation. In this article, the method of interfacing Ch scripts with MPI C implementations is introduced by using the MPICH2 C library as an example. The MPICH2-based Ch MPI package provides users with the ability to interpretively run MPI C program based on the MPICH2 C library. Running MPI programs through the MPICH2-based Ch MPI package across heterogeneous platforms consisting of Linux and Windows machines is illustrated. Comparisons for the bandwidth, latency, and parallel computation speedup between C MPI, Ch MPI, and MPI for Python in an Ethernet-based environment comprising identical Linux machines are presented. A Web-based example is given to demonstrate the use of Ch and MPICH2 in C based CGI scripting to facilitate the development of Web-based applications for parallel computing.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "FORTRAN (Computer programming language)"

1

Obua, Steven. Cosmopolitan Identifiers. Steven Obua as Recursive Mind, July 2021. http://dx.doi.org/10.47757/obua.cosmo-id.3.

Full text
Abstract:
I propose a simple Unicode-based lexical syntax for programming language identifiers using characters from international scripts (currently Latin, Greek, Cyrillic and Math). Such cosmopolitan identifiers are designed to achieve much of the simplicity of Fortran identifiers while acknowledging a modern international outlook. This seems particularly advantageous in contexts where such identifiers are not (only) used by professional programmers, but are exposed to normal users, for example through scriptable applications.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'FORTRAN (Computer programming language)' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography