Search - 7.14 - CodeBus

Search - 7.14 - List

[Algorithm] 计算几何 DL : 1: 目录㈠点的基本运算 1. 平面上两点之间距离 1 2. 判断两点是否重合 1 3. 矢量叉乘 1 4. 矢量点乘 2 5. 判断点是否在线段上 2 6. 求一点饶某点旋转后的坐标 2 7. 求矢量夹角 2 ㈡线段及直线的基本运算 1. 点与线段的关系 3 2. 求点到线段所在直线垂线的垂足 4 3. 点到线段的最近点 4 4. 点到线段所在直线的距离 4 5. 点到折线集的最近距离 4 6. 判断圆是否在多边形内 5 7. 求矢量夹角余弦 5 8. 求线段之间的夹角 5 9. 判断线段是否相交 6 10.判断线段是否相交但不交在端点处 6 11.求线段所在直线的方程 6 12.求直线的斜率 7 13.求直线的倾斜角 7 14.求点关于某直线的对称点 7 15.判断两条直线是否相交及求直线交点 7 16.判断线段是否相交，如果相交返回交点 7 ㈢多边形常用算法模块 1. 判断多边形是否简单多边形 8 2. 检查多边形顶点的凸凹性 9 3. 判断多边形是否凸多边形 9 4. 求多边形面积 9 5. 判断多边形顶点的排列方向，方法一 10 6. 判断多边形顶点的排列方向，方法二 10 7. 射线法判断点是否在多边形内 10 8. 判断点是否在凸多边形内 11 9. 寻找点集的graham算法 12 10.寻找点集凸包的卷包裹法 13 11.判断线段是否在多边形内 14 12.求简单多边形的重心 15 13.求凸多边形的重心 17 14.求肯定在给定多边形内的一个点 17 15.求从多边形外一点出发到该多边形的切线 18 16.判断多边形的核是否存在 19 ㈣圆的基本运算 1 .点是否在圆内 20 2 .求不共线的三点所确定的圆 21 ㈤矩形的基本运算 1.已知矩形三点坐标，求第4点坐标 22 ㈥常用算法的描述 22 ㈦补充 1．两圆关系： 24 2．判断圆是否在矩形内： 24 3．点到平面的距离： 25 4．点是否在直线同侧： 25 5．镜面反射线： 25 6．矩形包含： 26 7．两圆交点： 27 8．两圆公共面积： 28 9. 圆和直线关系： 29 10. 内切圆： 30 11. 求切点： 31 12. 线段的左右旋： 31 13．公式： 32
Date : 2009-04-13 Size : 12.87kb User : wangsiman66@sohu.com
[Algorithm] hyplas DL : 11: ************************************************************************ * * * * * THIS IS THE H Y P L A S 2.0 README FILE * * ----------------- * * * * HYPLAS is a finite element program for implicit small and large * * strain analisys of hyperelastic and elasto-plastic two-dimensional * * and axisymmetric solids * * * * HYPLAS v2.0 is the companion software to the textbook: * * EA de Souza Neto, D Peric & DRJ Owen. Computational Methods for * * Plasticity: Theory and Applications. Wiley, Chichester, 2008. * * (www.wiley.com/go/desouzaneto) * * * * Copyright (c) 1998-2008 EA de Souza Neto, D Peric, D.R.J. Owen * *----------------------------------------------------------------------* * File last updated: 18 October 2008 * * * * This file belongs in the directory ../HYPLAS_v2.0 * ************************************************************************ * * * I M P O R T A N T * * * * READ SECTIONS 0 TO 3 OF THIS FILE CAREFULLY BEFORE ATTEMPTING * * TO COMPILE AND RUN THE PROGRAM HYPLAS ON YOUR COMPUTER !! * * * * THE AUTHORS DO NOT GUARANTEE THAT ANY SUGGESTIONS/INSTRUCTIONS * * GIVEN IN THIS README FILE WILL WORK ON ANY PARTICULAR OPERATING * * SYSTEM. IF YOU DECIDE TO FOLLOW ANY SUGGESTIONS/INSTRUCTIONS * * GIVEN HERE YOU MUST DO SO AT YOUR OWN RISK. * * * * * * BUG REPORTS: Please send bug reports to * * * * hyplas_v2.0@live.co.uk * * * * Messages sent to the authors' personal email addresses * * will NOT be answered. * ************************************************************************ This file contains the following sections: 0. Copyright statement and disclaimer 0.(a) Copyright statement 0.(b) Disclaimer 0.(c) Conditions of use 1. Introduction 1.(a) Note on portability 2. Compiling and running HYPLAS 2.(a) Memory requirements 2.(b) Testing a newly compiled executable 3. The HYPLAS directory tree 4. Cross-referencing between the source code and the textbook 5. HYPLAS error messaging 6. Further remarks on HYPLAS ************************************************************************ 0. COPYRIGHT STATEMENT AND DISCLAIMER ================================== 0.(a) Copyright statement ------------------- You may only use this program for your own private purposes. You are not allowed, in any circumstances, to distribute this program (including its source code, executable and any other files related to it, either in their original version or any modifications introduced by you, the authors or any other party) in whole or in part, either freely or otherwise, in any medium, without the prior written consent of the copyright holders. 0.(b) Disclaimer ---------- This program (including its source code, executable and any other files related to it) is provided "as is" without warranty of any kind, either expressed or implied, including, but not limited to, any implied warranties of fitness for purpose. In particular, THIS PROGRAM IS BY NO MEANS GUARANTEED TO BE FREE FROM ERRORS. This program (or any modification incorporated to it by you, the authors or any other party) will run entirely at your risk. The results produced by this program are in no way guaranteed to be fit for any purpose. Under no circumstances will the authors/copyright holders be liable to anyone for damages, including any general, special, incidental or consequential damages arising from the use or inability to use the program (including, but not limited to, loss or corruption of data, failure of the program to operate in any particular way as well as damages arising from the use of any results produced by the program for any purpose). 0.(c) Conditions of use ----------------- You may only use this program if you fully understand and agree with the terms of the above disclaimer. You must not use this program if you do not agree with or do not understand (fully or in part) these conditions of use. 1. INTRODUCTION ============ HYPLAS is a finite element code for small and large strain analysis of hyperelastic and elasto-plastic solids. Most procedures implemented in HYPLAS are described in detail in its companion textbook: EA de Souza Neto, D Peric & DRJ Owen. Computational Methods for Plasticity: Theory and Applications. Wiley, Chichester, 2008 (www.wiley.com/go/desouzaneto). 1.(a) Note on Portability ------------------- HYPLAS has been written in standard ANSI FORTRAN 77. Currently, the only known (and deliberate) exceptions to the FORTRAN 77 ANSI standard are the instructions: INCLUDE '' used in many routines to include the HYPLAS database files (common blocks and global variables), and; CALL GETENV('HYPLASHOME',HYPLASHOME) used in subroutine "ERRPRT" (file ../HYPLAS_v2.0/src/GENERAL/errprt.f). This instruction inquires the name of the system environment variable HYPLASHOME and writes it on the character string HYPLASHOME. This instruction is NOT part of the ANSI FORTRAN 77 standard, but seems to work in most currently available FORTRAN 77 compilers. 2. COMPILING AND RUNNING H Y P L A S ================================== The HYPLAS source code is stored in directory ../HYPLAS_v2.0/src/ (../HYPLAS_v2.0/ being the current directory) and all its subdirectories. To generate an executable file, you just need to compile the FORTRAN source files: ../HYPLAS_v2.0/src/hyplas.f and ../HYPLAS_v2.0/src/*/*.f together. We recommend that the executable HYPLAS be stored in the directory ../HYPLAS_v2.0/bin to which the environment variable HYPLASHOME should be set (see below how to set a system environmental variable). WINDOWS (R) systems ------------------- On Microsoft Windows(R) systems, HYPLAS has been successfully compiled using Intel Visual Fortran Compiler(R) integrated with Microsoft Visual Studio(R). Here you only need to create a project that contains all Fortran source files mentioned above as well as the include files ..\HYPLAS_v2.0\src\*.INC On a Windows XP system, the system environment variable HYPLASHOME can be set as follows: 1. Open a File Manager 2. Right-click on the "My Computer" icon 3. Select "Properties" on the drop-down menu 4. A new window named "System Properties" will pop-up. Here select the "Advanced" tab. 5. On the "Advanced" tab, click the "Environment Variables" button. 6. A new window titled "Environment Variables" will pop-up. Here click the button "New" in the "System Variables" section of the window. 7. A new window will pop-up titled "New System Variable". Here you should fill the fields "Variable name" and "Variable Value", respectively, with HYPLASHOME and the path name (in full) of the directory ..\HYPLAS_v2.0\bin. 8. Press "OK" on the relevant pop-up windows. 9. The next time the computer is REBOOTED, this variable will be set to the correct path and HYPLAS should be able to find the error messages file ERROR.RUN if required. UNIX/LINUX systems ------------------ In a UNIX/LINUX operating system using a C-shell, for instance, the HYPLASHOME environment variable should be set with the command: setenv HYPLASHOME where here denotes the full path to the directory ../HYPLAS_v2.0/bin. To compile HYPLAS (from directory ../HYPLAS_v2.0/src) with a FORTRAN 77 compiler such as g77, you can use the command: g77 -o ../bin/hyplas hyplas.f */*.f Note that the executable file "hyplas" will be stored in the directory ../HYPLAS_2.0/bin (i.e. the directory set in the HYPLASHOME environment variable). Alternatively, you may use the Makefile provided (with suitable modifications, if needed) to create the HYPLAS executable. IMPORTANT: Before generating a HYPLAS executable, read Sections 2.(a) and 2.(b) below. 2.(a) Memory Requirements ------------------- HYPLAS memory requirements depend on the array dimensioning parameters set in files: ../HYPLAS_v2.0/src/ ELEMENTS.INC GLBDBASE.INC MATERIAL.INC MAXDIM.INC Files ELEMENTS.INC, GLBDBASE.INC and MATERIAL.INC contain parameters which are associated with the currently implemented finite elements and materials. DO NOT MODIFY THEM ! unless you are absolutely sure of what you are doing (only developers coding new elements or new material models/analysis types may need to modify them by changing the existing dimensioning parameters and/or including new parameters). The ONLY dimensioning file that can be safely modified by the average user is the file MAXDIM.INC This file contains the array dimensioning parameters related to the maximum permissible dimension of problems to be analysed by HYPLAS. These parameters include the maximum number of nodes, elements, element groups, etc. If necessary, CHANGE THESE PARAMETERS TO SUIT YOUR PROBLEM SIZE/MEMORY REQUIREMENTS before compiling HYPLAS. 2.(b) Testing a newly compiled executable ----------------------------------- After you have successfully compiled the HYPLAS source code and created an executable file, the next step is to run some tests to verify that HYPLAS is working well. To do this, proceed as follows: The directory ../HYPLAS_v2.0/book_examples/data_files contains a series of data files named .dat of benchmarked examples described in the companion textbook. The corresponding (benchmarked) result files are in the directory ../HYPLAS_v2.0/book_examples/result_files This directory contains a series of result files named .res generated with the current version of HYPLAS on a tested platform. All these files have been named such that their names start with the textbook section number where the corresponding example is described. For instance, files 14_9_2_tresca.dat and 14_9_2_tresca.res refer to a problem described in section 14.9.2 of the textbook, and so on. To check that HYPLAS is working well on your platform, after compiling HYPLAS, run the program HYPLAS for the examples of files .dat and compare the newly generated results .res with their benchmarked counterparts (of the same filename) in the result_files directory. To run an example, execute HYPLAS and use the keyboard to enter the name of the corresponding data file in full (including the extension .dat). To compare the benchmarked .res files against their newly generated you may proceed as follows: 1. On MICROSOFT WINDOWS systems - Here we have successfully used the software "ExamDiff" (the task was made particularly easy by selecting "View" and then the "Show Differences Only" option - this refers to version 1.8 of this software). 2. On UNIX/LINUX systems - Here we use the "diff" command from a shell window (and set the option to ignore blank spaces). A shell script may be used to perform this task automatically (including running HYPLAS and checking for result file differences) for all benchmarked examples provided. IMPORTANT: THE ONLY ACCEPTABLE DIFFERENCES BETWEEN A THE NEWLY GENERATED RESULT FILES AND THEIR BENCHMARKED COUNTERPARTS ARE THE DIMENSIONING PARAMETERS (FROM FILE MAXDIM.INC) USED TO COMPILE THE NEW EXECUTABLE (THESE PARAMETERS ARE PRINTED RIGHT AT THE BEGINNING OF THE RESULT FILES) AND NUMERICAL DIFFERENCES IN RESULTS DUE TO NUMERICAL "ROUNDING-OFF" (THESE ARE VERY SMALL DIFFERENCES THAT DEPEND ON THE PRECISION OF ARITHMETIC OPERATIONS IN THE PLATFORM USED). ALSO NOTE THAT THE EXAMPLES OF THE COMPANION TEXTBOOK DO NOT COVER ALL FEATURES OF HYPLAS. HENCE THIS TEST DOES NOT GUARANTEE THAT EVERYTHING IS WORKING PROPERLY. 3. THE H Y P L A S DIRECTORY TREE ================================ 3.(a) Summary ------- ../ HYPLAS_v2.0/ bin/ book_examples/ data_files/ result_files/ man/ html/ src/ CRYSTAL/ DAMAGE/ DAMAGED_ELASTIC/ DRUCKER_PRAGER/ ELASTIC/ ELEMENTS/ GENERAL/ MATERIALS/ MATHS/ MOHR_COULOMB/ OGDEN/ TRESCA/ VON_MISES/ VON_MISES_MIXED/ 3.(b) Description ----------- The HYPLAS program directory tree is organised as follows: ../HYPLAS_v2.0/ (this directory) This is the HYPLAS root directory, where the HYPLAS directory tree starts. ../HYPLAS_v2.0/bin/ This directory contains the file ERROR.RUN where most HYPLAS error/warning messages are. IMPORTANT: the environment variable HYPLASHOME should be set to this directory. Otherwise, HYPLAS will not find its error/warning messages when required. We also recommend that the EXECUTABLE of HYPLAS be stored in this directory. ../HYPLAS_v2.0/book_examples/ This directory has the following subdirectories: ../HYPLAS_v2.0/book_examples/data_files ../HYPLAS_v2.0/book_examples/result_files Refer to Section 2.(b) above for further details. ../HYPLAS_v2.0/man/ This is the HYPLAS documentation/manuals directory. It contains the following files: input_man.txt - A concise input data manual for HYPLAS in ASCII format; hyplas_calltree.txt - Contains a flowgraph (shows the call tree) of HYPLAS in ASCII-format. Note: calls to function subprograms are not included in this flowgraph; and the subdirectory: ../HYPLAS_v2.0/man/html This directory contains the hypertext (HTML) format Fortran source code and of manual pages of the entire HYPLAS program. Manual pages with descriptions of each function/subprogram including their argument list are linked to their corresponding HTML-format source code. This allows the user the navigate through the HYPLAS source code using a web browser. To start at the main program, use your web browser to open the file hyplas.html. This facility should be helpful to those trying to understand the flow of program HYPLAS. ../HYPLAS_v2.0/src/ This directory (and its subdirectories) contains the Fortran source code of HYPLAS. The files containing the sources are named following the standard practice: .f where is the name of the FORTRAN procedure (subroutine, function subprogram, etc.) whose source code is in file .f. The source code of the HYPLAS main program is in file hyplas.f and the HYPLAS database (COMMON blocks, array dimensioning parameters and other global parameters) is coded in the "include files" ELEMENTS.INC GLDBASE.INC MATERIAL.INC MAXDIM.INC in this directory. In addition, this directory contains a file named "Makefile" (UNIX-LINUX Release only) which may be used for compiling and linking HYPLAS in UNIX/LINUX systems. The subdirectories of ../HYPLAS_v2.0/src are as follows: ../HYPLAS_v2.0/src/CRYSTAL Contains the source code of all procedures related to the finite strain single crystal plasticity model implemented in HYPLAS. ../HYPLAS_v2.0/src/DAMAGE Source files of the procedures related to the Lemaitre ductile damage model implementation. ../HYPLAS_v2.0/src/DAMAGED_ELASTIC Source files of the procedures related to the damaged elasticity model with crack closure effect. ../HYPLAS_v2.0/src/DRUCKER_PRAGER Source files of the procedures related to the implemented Drucker-Prager plasticity model. ../HYPLAS_v2.0/src/ELASTIC Source files of the procedures related to the linear elasticity model (Hencky model under large strains) implemented. ../HYPLAS_v2.0/src/ELEMENTS Source files of the element interfaces and element-related procedures. ../HYPLAS_v2.0/src/GENERAL Source files of general procedures. ../HYPLAS_v2.0/src/MATERIALS Source files of the material interfaces. ../HYPLAS_v2.0/src/MATHS Source files of the mathematical procedures. ../HYPLAS_v2.0/src/MOHR_COULOMB Source files of the procedures related to the implemented Mohr-Coulomb plasticity model. ../HYPLAS_v2.0/src/OGDEN Source files of the procedures related to the implemented Ogden hyperelasticity model. ../HYPLAS_v2.0/src/TRESCA Source files of the procedures related to the implemented Tresca plasticity model. ../HYPLAS_v2.0/src/VON_MISES Source files of the procedures related to the implemented von Mises plasticity model with isotropic hardening. ../HYPLAS_v2.0/src/VON_MISES_MIXED Source files of the procedures related to the implemented von Mises plasticity model with mixed isotropic/kinematic hardening. 4. CROSS-REFERENCING BETWEEN THE SOURCE CODE AND THE TEXTBOOK ========================================================== Many references are made in the textbook to various subprograms of HYPLAS. These are usually made when a particular procedure described in the text is implemented in the program. The reader should refer to the textbook index. Also, a substantial number of comment lines have been added to the source code of HYPLAS with reference to sections, figures, boxes, etc of the textbook related to the part of the code in question. Such references are usually displayed after the word "REFERENCE:" (in capitals) on commented lines. Searching for this word will take you to the line of code where the particular routine has a reference to the textbook. NOTE: Occasional references to other textbooks/journal papers are also made following the word "REFERENCE:" on commented lines. 5. HYPLAS ERROR MESSAGING ====================== Most error/warning messages issued by HYPLAS are in the ASCII-format file ERROR.RUN (kept in the HYPLASHOME directory - ../HYPLAS_v2.0/bin). All such error/warning messages have an identification code (e.g. ED0015) which is printed both to the standard output (this is usually the computer screen) and to the relevant results file. If you wish to find where in the source code a particular message is being issued, then perform a search for the corresponding message identification code in the entire source code of HYPLAS. 6. FURTHER REMARKS ON HYPLAS ========================= 6.(a) Program efficiency THIS SECTION IS OF INTEREST ONLY TO THOSE WANTING TO MAKE HYPLAS RUN FASTER. It is particularly stressed in the textbook that this program has not been designed having efficiency in mind (refer to Section 5.1.2 of the textbook). Its structure has been designed mainly to illustrate in a relatively clear manner the computer implementation of the techniques and algorithms described in the text, with a particular view to the implementation of solid constitutive models and finite elements. For those who are especially interested in the speed of the code, there are a few tips that could help in this direction. Unfortunately, these involve modifications to the source code which is probably most appropriate to readers with a good level of experience in finite element programming. To those with this particular interest, we can suggest the following: (i) The use of faster linear solvers This is probably the change that would result in a greater gain in efficiency. The Frontal Method adopted in subroutine FRONT (file ../HYPLAS_v2.0/src/GENERAL/front.f) has been designed originally to save memory (back in the days when computer memory was severely limited). There are currently a vast number of methodologies which focus on speeding up the linear solution, in addition to reducing memory storage requirements (which is a particularly important issue in the solution of large scale problems). Some of these are extensions/refinements of the original Frontal solver. We remark that a number of such procedures (with their respective source codes) are available (conditions may apply) from the LAPACK (Linear Algebra PACKage - http://www.netlib.org/lapack) repository or from the HSL Library (http://www.cse.cse.scitech.ac.uk/nag/hsl). For the reader interested in gaining speed, we would recommend the replacement of the existing solver of FRONT by a faster one. We remark though that this is a substantial programming task. Another aspect here is the fact that computing times in FRONT are directly linked to the frontwidth of the system which, in the present version of HYPLAS is fixed and depends, for a given mesh, on how the degrees of freedom are numbered (node numbering). The incorporation of a frontwidth optimiser (which re-numbers the degrees of freedom in order to minimise the frontwidth) in FRONT could produce some good savings in computing times. Such savings become particularly noticeable in larger problems where the original node numbering produces an excessively large frontwidth. (ii) Material-specific computations The issues pointed out here affect only the computing times for specific material models and are expected to have a much lower impact in overall speed than the linear solver issue discussed above. Some of the material model-specific computations carried out in HYPLAS could be made a bit faster. For example, for isotropic models whose stress update is carried out in the principal stress space (such as the Tresca and Mohr-Coulomb models - see routines SUTR and SUMC, files ../HYPLAS_v2.0/src/TRESCA/sutr.f and ../HYPLAS_v2.0/MOHR_COULOMB/sumc.f, respectively) the spectral decomposition of the stress in carried out in the state update update routine and then repeated in the corresponding routine for computation of the consistent tangent operator (refer to files ../HYPLAS_v2.0/src/TRESCA/cttr.f and ../HYPLAS_v2.0/src/MOHR_COULOMB/ctmc.f, respectively, for the Tresca and Mohr-Coulomb plasticity models). Some savings in computing time can be achieved here by storing the stress eigenprojection tensors (these can be stored as state variables) during the execution of the state updating and then retrieving them later for use in the computation of the consistent tangent operator. This change can be incorporated to the code relatively easily. The computation of the exponential map and is derivative for the single crystal plasticity model (routines EXPMAP, file ../HYPLAS_v2.0/src/CRYSTAL/expmap.f and DEXPMP, file ../HYPLAS_v2.0/src/CRYSTAL/dexpmp.f) is carried out in three dimensions (these routines have been adapted from an earlier three-dimensional code). To improve efficiency, these can be adapted to work only in two-dimensional problems by removing the unnecessary operations related to the third dimension. 6.(b) Output of nodal averaged values The reader should be aware that the way in which nodal averaged values of stresses and other variables are calculated in HYPLAS is very basic (and rudimentary). This feature of the program is made available only to help those interested in producing contour plots, etc from results presented in HYPLAS result files and should be useful in many circumstances of interest. This facility has in fact been used in producing many of the figures presented in the textbook. But note, for example, that the values of incremental plastic multipliers for plasticity models may take (inadmissible) negative values when extrapolated from Gauss-point to nodes and averaged. We remark that more sophisticated and refined techniques of transferring Gauss point values of variables to nodal points and obtaining the corresponding smoothed field are available in the current literature. These fall outside the scope of the companion textbook of HYPLAS.
Date : 2011-07-29 Size : 10.5mb User : gtcewli3
[Algorithm] netsafe DL : 0: 爱因斯坦在20世纪初出的这个谜语。他说世界上有98％的人答不出来。某家公司在面试应聘者时借用了爱因斯坦的这个IQ题，考查应聘者的IQ，现在我们暂且不去讨论这个公司用这样的题目来考查应聘者的IQ有多“变态”，如果是你，拿到了这样的笔试题目，你能做得出来吗？　　1、在一条街上，有5座房子，喷了5种颜色。　　2、每个房里住着不同国籍的人　　3、每个人喝不同的饮料，抽不同品牌的香烟，养不同的宠物　　问题是：谁养鱼？　　提示：　　1、英国人住红色房子　　2、瑞典人养狗　　3、丹麦人喝茶　　4、绿色房子在白色房子左面　　5、绿色房子主人喝咖啡　　6、抽Pall Mall 香烟的人养鸟　　7、黄色房子主人抽Dunhill 香烟　　8、住在中间房子的人喝牛奶　　9、挪威人住第一间房　　10、抽Blends香烟的人住在养猫的人隔壁　　11、养马的人住抽Dunhill 香烟的人隔壁　　12、抽Blue Master的人喝啤酒　　13、德国人抽Prince香烟　　14、挪威人住蓝色房子隔壁　　15、抽Blends香烟的人有一个喝水的邻居　　以上是爱因斯坦在20世纪初出的这个谜语。他说世界上有98％的人答不出来。用递归算法实现-Einstein in the early 20th century out of this riddle. He said the world have 98% of the people not answer. A company in interviews when candidates use Einstein's IQ that, to investigate the IQ candidates, we will put aside the discussion of the company do not use this topic to test the IQ candidates how "abnormal", if you get such a written subject, can you come up with? ? One, in a street, five houses, sprayed the five colors. Two, every room of different nationalities lived three people each drink different drinks, pumping different brands of cigarettes, raising the pet question is : Who fish? Tip : 1, the British Red lived two houses, three dogs Sweden, Denmark, four tea, green house in the house left five white, green coffee house owner 6, pumping Pall Mall cigarettes be
Date : 2025-12-18 Size : 14kb User : 李东
[Algorithm] Project DL : 0: C 语言开发的日历（课程设计很不错的） Month:123/1 --- --- --- Sun Mon Tue Wed Thu Fri Sat 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31-C language developed by the calendar (of course design is very good) Month: 123/1------ Sun Mon Tue Wed Thu Fri Sat 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
Date : 2025-12-18 Size : 3kb User : zhangdan
[Algorithm] Sum DL : 0: 算法实现题1-2 连续和问题 « 问题描述：给定一个正整数n，计算有多少个不同的连续自然数段，其和恰为n。例如，当n=27 时，有4 个不同的连续自然数段的和恰为27：2+3+4+5+6+7；8+9+10；13+14；27。 « 编程任务：给定一个正整数n，试设计一个O(n)时间算法，计算有多少个不同的连续自然数段的和恰为n。 « 数据输入：由文件input.txt提供输入数据。文件的第1 行是正整数n。 « 结果输出: 程序运行结束时，将计算出的和恰为n的连续自然数段的个数输出到output.txt中。输入文件示例输出文件示例 input.txt 27 output.txt 4 -Algorithm 1-2 consecutive title and the issue of ?Description of the problem: given a positive integer n, calculate the number of consecutive natural number of different paragraph, and its and exactly n. For example, when n = 27, there were four different sections for natural and exactly 27:22 B! 3+ 4+ 5+ 6+ 7 8+ 9+ 10 13+ 14 27. ?Programming tasks: Given a positive integer n, try to design a O (n) time algorithm to calculate the number of different section of consecutive natural numbers and exactly n. ?Data input: from file input.txt to provide input data. Paragraph 1 line is a positive integer n. ?The results output: program to run at the end will be calculated and exactly the consecutive natural number n the number of paragraphs in the output to output.txt. Sample input file output file example input.txt 27 output.txt 4
Date : 2025-12-18 Size : 1kb User : Tonsen
[Algorithm] 7-14 DL : 0: MATLAB的基于卡尔曼滤波器的机动目标跟踪-MATLAB Kalman filter-based tracking of maneuvering targets
Date : 2025-12-18 Size : 2kb User : 刘飞南
[Algorithm] NR_C301 DL : 0: Numerical.Recipes-数值算法最著名的常用数值算法程序集，C++及C形式的源代码 1 Preliminaries 2 Solution of Linear Algebraic Equations 3 Interpolation and Extrapolation 4 Integration of Functions 5 Evaluation of Functions 6 Special Functions 7 Random Numbers 8 Sorting 9 Root Finding and Nonlinear Sets of Equations 10 Minimization or Maximization of Functions 11 Eigensystems 12 Fast Fourier Transform 13 Fourier and Spectral Applications 14 Statistical Description of Data 15 Modeling of Data 16 Integration of Ordinary Differential Equations 17 Two Point Boundary Value Problems 18 Integral Equations and Inverse Theory 19 Partial Differential Equations 20 Less-Numerical Algorithms -Numerical.Recipes The Art of Scientific Computing Third Edition Cambridge University Press 2007
Date : 2025-12-18 Size : 997kb User : Michael
[Algorithm] VisualC DL : 0: 常用数值算法源代码第1章线性代数方程组的解法,第2章插值,第3章数值积分,第4章特殊函数,第5章函数逼近,第6章随机数,第7章排序第8章特征值问题第9章数据拟合第10章方程求根和非线性方程组的解法第11章函数的极值和最优化第12章傅里叶变换谱方法第13章数据的统计描述第14章解常微分方程组第15章两点边值问题的解法第16章偏微分方程的解法-Numerical algorithm used
Date : 2025-12-18 Size : 60.22mb User : 龚云隆
[Algorithm] LECalculator DL : 0: 3．1 线性方程组类设计 3．2 全选主元高斯消去法 3．3 全选主元高斯-约当消去法 3．4 复系数方程组的全选主元高斯消去法 3．5 复系数方程组的全选主元高斯-约当消去法 3．6 求解三对角线方程组的追赶法 3．7 一般带型方程组的求解 3．8 求解对称方程组的分解法 3．9 求解对称正定方程组的平方根法 3．10 求解大型稀疏方程组的全选主元高斯-约当消去法 3．11 求解托伯利兹方程组的列文逊方法 3．12 高斯-赛德尔迭代法 3．13 求解对称正定方程组的共轭梯度法 3．14 求解线性最小二乘问题的豪斯荷尔德变换法 3．15 求解线性最小二乘问题的广义逆法 3．16 病态方程组的求解 -3.1 system of linear equations class designs 3.2 to choose the principal element gaussian elimination 3.3 to elect principal element Gauss- when approximately the elimination 3.4 duplicate coefficient equation sets all choose the principal element gaussian elimination 3.5 duplicate coefficient equation sets to elect principal element Gauss- when approximately the elimination 3.6 solve three diagonal line equation sets to pursue the law 3.7 common belt equation set s solution 3.8 solution symmetrical equation set s resolution 3.9 solution symmetrical Zhengding equation set s square root method 3.10 solution large-scale sparse equation set to elect principal element Gauss- when approximately the elimination 3.11 solutions hold the Belize equation set s row article to abdicate House Holland who method 3.12 Gauss- the Seydell repetitive process 3.13 solution symmetrical Zhengding equation set s conjugate gradient method 3.14 solution linearity is smallest two rides the questionThe German m
Date : 2025-12-18 Size : 70kb User : 王健
[Algorithm] Eular-Engineering DL : 0: 自然数求和可生成三角数列.第七个三角数是1 + 2 + 3 + 4 + 5 + 6 + 7 = 28.前10个三角数列元素是: 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ... 下面列出前7个三角数及其整除数: 1: 1 3: 1,3 6: 1,2,3,6 10: 1,2,5,10 15: 1,3,5,15 21: 1,3,7,21 28: 1,2,4,7,14,28 可以看出,28是第一个有超过5个整除数的三角数. 那么,第一个有超过500个整除数的三角数是多少?-The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1+ 2+ 3+ 4+ 5+ 6+ 7 = 28. The first ten terms would be: 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ... Let us list the factors of the first seven triangle numbers: 1: 1 3: 1,3 6: 1,2,3,6 10: 1,2,5,10 15: 1,3,5,15 21: 1,3,7,21 28: 1,2,4,7,14,28 We can see that 28 is the first triangle number to have over five divisors. What is the value of the first triangle number to have over five hundred divisors?
Date : 2025-12-18 Size : 4kb User : superman
[Algorithm] huaxuewenti DL : 0: 滑雪中，是为了获得速度，滑的区域必须向下倾斜。Michael想知道在一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3 4 5 16 17 18 19 6 15 24 25 20 7 14 23 22 21 8 13 12 11 10 9 一个人可以从某个点滑向上下左右相邻四个点之一，当且仅当高度减小。在上面的例子中，一条可滑行的滑坡为24-17-16-1。当然25-24-23-...-3-2-1更长。事实上，这是最长的一条。 - Skiing in order to gain speed, the area must slope downward slide. Michael wants to know the end of the longest in a landslide area. Region is given by a two-dimensional array. Each number represents an array of point level. Here is an example 12345 161,718,196 152,425,207 142,322,218 131,211,109 A person can slide up and down from a point adjacent to one of four points, if and only if highly reduced. In the above example, one can slide the slide is 24-17-16-1. Of course 25-24-23-...- 3-2-1 longer. In fact, this is the longest.
Date : 2025-12-18 Size : 1kb User : Li
[Algorithm] Njieluoxuan DL : 0: 设定N值，输出N阶螺旋方阵。以四边的数的行列规律为基础，向中间螺旋输出数值。如4则：1 2 3 4 12 13 14 5 11 16 15 6 10 9 8 7 . 完毕。-Set of N values, the output of N-order spiral square. Number of the four sides of the ranks of law, based on the output value to the middle spiral. Such as 4: 1 2 3 4 12 13 14 5 11 16 15 6 10 9 8 7 is completed.
Date : 2025-12-18 Size : 166kb User : 李名
[Algorithm] MatrixCalculator DL : 0: 2．1 矩阵类设计 2．2 矩阵基础运算 2．3 实矩阵求逆的全选主元高斯-约当法 2．4 复矩阵求逆的全选主元高斯-约当法 2．5 对称正定矩阵的求逆 2．6 托伯利兹矩阵求逆的特兰持方法 2．7 求行列式值的全选主元高斯消去法 2．8 求矩阵秩的全选主元高斯消去法 2．9 对称正定矩阵的乔里斯基分解与行列式的求值 2．10 矩阵的三角分解 2．11 一般实矩阵的QR分解 2．12 一般实矩阵的奇异值分解 2．13 求广义逆的奇异值分解法 2．14 约化对称矩阵为对称三对角阵的豪斯荷尔德变换法 2．15 实对称三对角阵的全部特征值与特征向量的计算 2．16 约化一般实矩阵为赫申伯格矩阵的初等相似变换法 2．17 求赫申伯格矩阵全部特征值的QR方法 2．18 求实对称矩阵特征值与特征向量的雅可比法 2．19 求实对称矩阵特征值与特征向量的雅可比过关法 -2.1 matrices class design 2.2 matrix foundations to operate 2.3 solid matrix inversions to elect principal element Gauss- when approximately the law 2.4 duplicate matrix inversions all elect principal element Gauss- when approximately the law 2.5 symmetrical Zhengding matrices ask the counter 2.6 request Belize matrix inversion to hold method 2.7 to ask the determinant value especially blue to choose the principal element gaussian elimination 2.8 to ask the matrix order to elect principal element gaussian elimination 2.9 symmetrical Zhengding matrices Jory Siji to decompose and the determinant evaluation 2.10 matrix triangles decompose 2.11 general solid matrices QR to decompose 2.12 general solid matrices the singular values to decompose 2.13 to ask the generalized counter singular value resolution 2.14 reduction symmetrical matrices for the symmetrical three opposite angle House Holland GermanyA method of transformation 2.15 solid symmetrical three opposite angle complete characteris
Date : 2025-12-18 Size : 64kb User : 王健
[Algorithm] NLequationCalculator DL : 0: 4．1 非线性方程与方程组类设计 4．2 求非线性方程实根的对分法 4．3 求非线性方程一个实根的牛顿法 4．4 求非线性方程一个实根的埃特金迭代法 4．5 求非线性方程一个实根的连分式解法 4．6 求实系数代数方程全部根的QR方法 4．7 求实系数代数方程全部根的牛顿-下山法 4．8 求复系数代数方程全部根的牛顿-下山法 4．9 求非线性方程组一组实根的梯度法 4．10 求非线性方程组一组实根的拟牛顿法 4．11 求非线性方程组最小二乘解的广义逆法 4．12 求非线性方程一个实根的蒙特卡洛法 4．13 求实函数或复函数方程的一个复根的蒙特卡洛法 4．14 求非线性方程组一组实根的蒙特卡洛法 -4.1 nonlinear equation and the equation set class designs 4.2 to ask the nonlinear equation real roots the binary search method 4.3 to ask nonlinear equation real roots the Newton law 4.4 to ask nonlinear equation real roots the Etkin repetitive process 4.5 to ask nonlinear equation real roots the continued fraction solution 4.6 to strive for realism the coefficient algebraic equation complete root QR method 4.7 to strive for realism coefficient algebraic equation complete root Newton- to descend the mountain Newton who law 4.8 ask the duplicate coefficient algebraic equation complete root- to descend the mountain law 4.9 to ask nonlinear simultaneous equation group of real roots the gradient method 4.10 to ask nonlinear simultaneous equation group of real roots to plan the Newton law 4.11 to ask the nonlinear simultaneous equation to be smallest two rides the solution generalized counter method 4.12 to ask nonlinear equation real rootsThe Monte-Carlo law 4.13 strive for realism the fu
Date : 2025-12-18 Size : 74kb User : 王健
[Algorithm] Interpolater DL : 0: 5．1 插值类设计 5．2 一元全区间不等距插值 5．3 一元全区间等距插值 5，4 一元三点不等距插值 5．5 一元三点等距插值 5．6 连分式不等距插值 5．7 连分式等距插值 5．8 埃尔米特不等距插值 5．9 埃尔米特等距插值 5．10 埃特金不等距逐步插值 5．11 埃特金等距逐步插值 5．12 光滑不等距插值 5．13 光滑等距插值 5．14 第一种边界条件的三次样条函数插值、微商与积分 5．15 第二种边界条件的三次样条函数插值、微商与积分 5．16 第三种边界条件的三次样条函数插值、微商与积分 5．17 二元三点插值 5．18 二元全区间插值 -5.1 interpolations class design between a 5.2 Yuan entire district not between an equal-space interpolation 5.3 Yuan entire district an equal-space interpolation 5,4 Yuan three spot not equal-space interpolation 5.5 Yuan three equal-space interpolation 5.6 continued fraction not equal-space interpolation 5.7 continued fraction equal-space interpolation 5.8 Hermite not equal-space interpolation 5.9 Hermite equal-space interpolation 5.10 Etkin not the equal-space gradually interpolation 5.11 Etkin equal-space gradually interpolation 5.12 smooth not equal-space interpolation 5.13 smooth equal-space interpolation 5.14 first kind of boundary condition three spline function interpolation, the derivative and the integral 5.15 second kind of boundary condition three spline function interpolation, the derivative and the integral 5.16 third kind of boundary condition three spline function interpolation, the derivative and the integral between 5.17 dual three interpolation 5.18 dual entire distri
Date : 2025-12-18 Size : 47kb User : 王健
[Algorithm] ks DL : 0: KS2D1S K-S test in two dimensions, data vs. model (14.7) KS2D2S K-S test in two dimensions, data vs. data (14.7)-numerical recipes
Date : 2025-12-18 Size : 1kb User : Rujie Liu
[Algorithm] file DL : 0: Joe and his entire College, total 1337 of them, went for a picnic. They were bored and they planned a game. Everybody stand in a circle, each of them identifiers starting 1 to 1337 consecutively in a circle, clockwise. The rule is that “a numbering CONTAINS or DIVISIBLE by 7, will reverse the direction”. Let’s elaborate the game a bit more. The identifiers of the students who yell-out successive numbers, are: 1,2,3,4,5,6,7 (student 7 has just yell “7” and reversed the direction),6,5,4,3,2,1,1337 (student 1337 has just yell “14” and reversed the direction),1,2,3 (student 3 has just yell “17” and reversed the direction),2,1,1337,1336, and so on. Joe has his favorite number, and he wants to calculate where in the circle he should stand to yell that number out loud. Now that the game is set, Joe wants to stand a place where he could yell his favourite number. Would you please help Joe? -Joe and his entire College, total 1337 of them, went for a picnic. They were bored and they planned a game. Everybody stand in a circle, each of them identifiers starting 1 to 1337 consecutively in a circle, clockwise. The rule is that “a numbering CONTAINS or DIVISIBLE by 7, will reverse the direction”. Let’s elaborate the game a bit more. The identifiers of the students who yell-out successive numbers, are: 1,2,3,4,5,6,7 (student 7 has just yell “7” and reversed the direction),6,5,4,3,2,1,1337 (student 1337 has just yell “14” and reversed the direction),1,2,3 (student 3 has just yell “17” and reversed the direction),2,1,1337,1336, and so on. Joe has his favorite number, and he wants to calculate where in the circle he should stand to yell that number out loud. Now that the game is set, Joe wants to stand a place where he could yell his favourite number. Would you please help Joe?
Date : 2025-12-18 Size : 1kb User : Suzi
[Algorithm] Convert DL : 0: 不但可以从二进制、八进制、十进制到十六进制之间的相互转换。还支持3、4、、5、6、7、9、11、12、13、14、15等进制的转换。不仅如此，还可以联合26个英文字母的大小写，再加上10个阿拉伯数字组成62个数字进行62进制的转换。甚至，可以弄个“天”，“地”两个符号，组成64进制。哈哈。-Not only binary, octal, decimal to hexadecimal conversion between. Also supports 3, 4, etc. 5,6,7,9,11,12,13,14,15 hex conversion. Not only that, but also it can be combined in the case of 26 English letters, plus 10 digits consisting of 62 numbers of 62 decimal conversion. Even, you can get hold of " Heaven" and " land" two symbols, compose 64 hex. Haha.
Date : 2025-12-18 Size : 2kb User : zngsai
[Algorithm] excel_vba_PLZHUH DL : 0: Program Name : JK Permutations & Combinations for Microsoft Excel VBA Ver3.0 English Edition March 14, 2002 Copyright: YOSHIDA Hajime 2001-2002 Based on JK Ver2.2 for MS-DOS 1993- Program Name : JK Permutations & Combinations for Microsoft Excel VBA Ver3.0 English Edition March 14, 2002 Copyright: YOSHIDA Hajime 2001-2002 Based on JK Ver2.2 for MS-DOS 1993
Date : 2025-12-18 Size : 82kb User : 冯海青
[Algorithm] GBFMT-Image-Denoising-Codes DL : 0: This software release consists of an implementation of the algorithm described in the paper: B. K. Shreyamsha Kumar, “Image Denoising based on Gaussian/Bilateral Filter and its Method Noise Thresholding , Signal, Image and Video Processing, pp. 1-14, 2012. (doi: 10.1007/s11760-012-0372-7) Download Original manuscript http://link.springer.com/article/10.1007/s11760-012-0372-7 in the Publications link. Download draft manuscript https://sites.google.com/site/shreyamsha in the Publications link. It consists of the following files: readme.txt: this file -This software release consists of an implementation of the algorithm described in the paper: B. K. Shreyamsha Kumar, “Image Denoising based on Gaussian/Bilateral Filter and its Method Noise Thresholding , Signal, Image and Video Processing, pp. 1-14, 2012. (doi: 10.1007/s11760-012-0372-7) Download Original manuscript http://link.springer.com/article/10.1007/s11760-012-0372-7 in the Publications link. Download draft manuscript https://sites.google.com/site/shreyamsha in the Publications link. It consists of the following files: readme.txt: this file
Date : 2025-12-18 Size : 126kb User : mahsy