Script started on Mon Mar 27 18:32:57 2017
$ sbcl
This is SBCL 1.3.10.openbsd.1, an implementation of ANSI Common Lisp.
More information about SBCL is available at .
SBCL is free software, provided as is, with absolutely no warranty.
It is mostly in the public domain; some portions are provided under
BSD-style licenses. See the CREDITS and COPYING files in the
distribution for more information.
* (ql:quickload "femlisp")
To load "femlisp":
Load 1 ASDF system:
femlisp
; Loading "femlisp"
...Measuring effective cache size (this may take some time)...
10 1.81
11 1.81
12 1.8
13 1.8
14 1.79
15 1.79
16 1.8
17 1.81
18 1.85
19 1.95
..
;;; *************************************************************************
;;; Infix notation for Common Lisp.
;;; Version 1.3 28-JUN-96.
;;; Written by Mark Kantrowitz, CMU School of Computer Science.
;;; Copyright (c) 1993-95. All rights reserved.
;;; May be freely redistributed, provided this notice is left intact.
;;; This software is made available AS IS, without any warranty.
;;; *************************************************************************
.............................................
.....
*** Femlisp-2.0.1 ***
Copyright (C) 2003-2017
Nicolas Neuss
University Heidelberg, KIT Karlsruhe, University Erlangen-Nuernberg.
Femlisp comes with ABSOLUTELY NO WARRANTY, for details see the
file LICENSE in the Femlisp main directory. This is free
software, and you are welcome to redistribute it under certain
conditions.
You can enter "(fl.demo:femlisp-demo)" to get a guided tour
through Femlisp, and enter "(quit)" to leave the program.
("femlisp")
* (fl.demo::femlisp-demo)
****************************************************************
Femlisp demo suite
This is the root of the standard Femlisp demos. Choose the
demo you want to see by typing its name or an abbreviation.
Such abbreviations can be of the form `h-2' for
`homogenization-2D'.
Type `up' or `back' to go up in the demo hierarchy, `quit' to
quit, and '?' or 'help' for help.
* Refine - Shows regular refinements of geometric bodies.
* Discretization - Demonstrate discretization aspects
* Solvers - Demonstrate solver aspects
* Equations - Solve several types of pdes
* Eigenvalues - Computing eigenvalues and eigenvectors
* Adaptivity - Adaptive solution
* Homogenization - Computing effective coefficients
* Articles - Calculations connected to articles
* Books - Collection of demos for books
* Courses - Collection of demos for courses
* Talks - Collection of demos for talks
Your choice (? for help): equ
****************************************************************
Solve several types of pdes
* laplace - Several problems involving Laplace equation
* heat - Problems involving the heat equation
* cdr - convection-diffusion-reaction equations
* elasticity - Solve problems in linear elasticity
* Navier-Stokes - Solve Navier-Stokes flow problems
Your choice (? for help): lap
****************************************************************
Several problems involving Laplace equation
* unit-interval - Solve the Laplace equation on a unit-interval.
* unit-triangle - Solve the Laplace equation on a unit-triangle.
* unit-quadrangle - Solve the Laplace equation on a unit-quadrangle.
* unit-tetrahedron - Solve the Laplace equation on a unit-tetrahedron.
* unit-wedge-1-2 - Solve the Laplace equation on a unit-wedge-1-2.
* unit-wedge-2-1 - Solve the Laplace equation on a unit-wedge-2-1.
* unit-cube - Solve the Laplace equation on a unit-cube.
* bl-diffusion-2d - Computes a boundary law coefficient
* bl-diffusion-3d - Computes a boundary law coefficient
* Electromagnetic potential - Electromagnetic potential
Your choice (? for help): elec
****************************************************************
Electromagnetic potential
Solves the Laplace equation for computing the
electromagnetic potential between two electrodes in a domain
with a piecewise constant permeability. Triangle is used for
mesh generation.
This problem was suggested by Sebastian Sturm.
Iteration
Step CELLS DOFS CPU
--------------------------------
; in:
; DEFMETHOD FL.MATLISP:GETRS! (FL.MATLISP::|(STANDARD-MATRIX DOUBLE-FLOAT)|
; FL.MATLISP::|(STANDARD-MATRIX DOUBLE-FLOAT)|)
; (LENGTH FL.MATLISP::IPIV)
;
; note: unable to
; optimize
; due to type uncertainty:
; The first argument is a (OR NULL
; (SIMPLE-ARRAY (SIGNED-BYTE 32)
; (*))), not a (SIMPLE-ARRAY * (*)).
;
; note: unable to
; optimize
; due to type uncertainty:
; The first argument is a (OR NULL
; (SIMPLE-ARRAY (SIGNED-BYTE 32)
; (*))), not a VECTOR.
;
; compilation unit finished
; printed 2 notes
> Iteration ()
> Step ||residual|| res[k]/res[k-1]
> -------------------------------------
> 0 4.00000d+00 UNDEFINED
debugger invoked on a SIMPLE-ERROR:
argument A given to GESV! is singular to working machine precision
Type HELP for debugger help, or (SB-EXT:EXIT) to exit from SBCL.
restarts (invokable by number or by possibly-abbreviated name):
0: [ABORT] Exit debugger, returning to top level.
((:METHOD FL.MATLISP:GESV! (T T)) #M((0.0d0)) #M((1.0d0))) [fast-method]
0] 0
*
Script done on Mon Mar 27 18:34:22 2017