A COMPUTER PROGRAM FOR A LATERALLY LOADED LONG PILE
M. Babu Rao, U S Rao
Abstract
M. Babu Rao, U S Rao
Abstract
This paper describes a computer program for determining deflections, slopes, moments, shears, and soil reactions for all points along the pile. It takes the various types of boundary conditions at the top of the pile into account. The analysis is based on the Numerical Finite Difference Method as suggested by Palmer and Thompson, which accounts for any form of variation of soil modulus, etc. Glesser's procedure of solving the difference equation has been used in the computer program. The program is called FRHP. A FORTRAN-77 listing of the program is given in Appendix A. A simple arrangement of input data and output for a sample problem is provided in Appendix C. The results provided by this program are compared with those obtained using the Matlock and Reese method in Appendix C. For the covering abstract see IRRD 860938.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
This paper describes a computer program for determining deflections, slopes, moments, shears, and soil reactions for all points along the pile. It takes the various types of boundary conditions at the top of the pile into account. The analysis is based on the Numerical Finite Difference Method as suggested by Palmer and Thompson, which accounts for any form of variation of soil modulus, etc. Glesser's procedure of solving the difference equation has been used in the computer program. The program is called FRHP. A FORTRAN-77 listing of the program is given in Appendix A. A simple arrangement of input data and output for a sample problem is provided in Appendix C. The results provided by this program are compared with those obtained using the Matlock and Reese method in Appendix C. For the covering abstract see IRRD 860938.
Key concepts: Computer program, Fortran, Pile, Listing (finance), Boundary (topology), Simple (philosophy), Finite difference, Computer science